Revisiting two classical results on graph spectra

zbMATH Open1111.05062arXivmath/0609111MaRDI QIDQ870073FDOQ870073

Vladimir Nikiforov

Publication date: 12 March 2007

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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).

Full work available at URL: https://arxiv.org/abs/math/0609111

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cited In (11)

• On the stability of the principal ratio
• On the spectra and spectral radii of token graphs
• The maximum principal ratio of graphs
• The spectral radius of irregular graphs
• On the signless Laplacian spectral radius of irregular graphs
• The extreme eigenvalues and maximum degree of \(k\)-connected irregular graphs
• On the principal eigenvectors of uniform hypergraphs
• On bounds of extremal eigenvalues of irreducible and \(m\)-reducible matrices
• Maximum principal ratio of the signless Laplacian of graphs
• Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
• Title not available (Why is that?)

   Recommendations

• The spectral radius of subgraphs of regular graphs 👍 👎
• Bounds on graph spectra 👍 👎
• Extreme eigenvalues of nonregular graphs 👍 👎
• Eigenvalues and diameter 👍 👎
• Bounds on graph eigenvalues. I 👍 👎

This page was built for publication: Revisiting two classical results on graph spectra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870073)