Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs
- 17 Downloads
Let G be a simple graph with n vertices and m edges. In this paper, we present some new upper bounds for the adjacency and the signless Laplacian spectral radius of graphs in which every pair of adjacent vertices has at least one common adjacent vertex. Our results improve some known upper bounds. The main tool we use here is the Lagrange identity.
Keywordsgraph spectral radius signless Laplacian spectral radius upper bound
MR Subject Classification05C50
Unable to display preview. Download preview PDF.
- Y Hong. A bound on the spectral radius of graph in terms of genus, Combin Theory Ser B, 1998(74): 153–159.Google Scholar