Revisiting two classical results on graph spectra

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2006-09-04
dc.date.accessioned2026-07-07T07:24:30Z
dc.date.available2026-07-07T07:24:30Z
dc.descriptionLet 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).
dc.identifierhttps://arxiv.org/abs/math/0609111
dc.identifierhttp://arxiv.org/abs/math/0609111
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116376
dc.subjectCombinatorics
dc.subjectCommutative Algebra
dc.subject05C50
dc.titleRevisiting two classical results on graph spectra
dc.typetext

Files

Collections

arXiv