arXiv Analytics

Sign in

arXiv:math/0609111 [math.CO]AbstractReferencesReviewsResources

Revisiting two classical results on graph spectra

Vladimir Nikiforov

Published 2006-09-04Version 1

Let mu(G) and mu_min(G) be the largest and smallest eigenvalues of the adjacency matricx of a graph G. We refine quantitatively the following two results on graph spectra. (i) if H is a proper subgraph of a connected graph G, then mu(G)>mu(H). (ii) if G is a connected nonbipartite graph, then mu(G)>-mu_min(G).

Categories: math.CO, math.AC
Subjects: 05C50
Related articles: Most relevant | Search more
arXiv:1310.5292 [math.CO] (Published 2013-10-20)
Bounds on the spectral radius of nonnegative matrices and applications in graph spectra
arXiv:1411.6668 [math.CO] (Published 2014-11-24)
Density of 5/2-critical graphs
arXiv:1610.08855 [math.CO] (Published 2016-10-27)
The signless Laplacian spectral radius of subgraphs of regular graphs

Links

Toolbox