Answers are grounded in this paper and cite their sources.
For a k -graph H = ( V ( H ), E ( H )), let B ( H ) be its incidence matrix, and Q ( H ) = B ( H ) B ( H ) T be its signless Laplacian matrix, and this name comes from the fact that Q ( H ) is exactly the well-known signless Laplacian matrix for 2-graph. Define the largest eigenvalue ρ ( H ) of Q ( H ) as the spectral radius of H . In this paper, we give some lower and upper bounds on ρ ( H ) using some structural parameters (such as independent number, maximum degree, minimum degree, diameter, and so on) of H , which extended or improved some known results.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: