Bounds on graph eigenvalues

DOI10.1016/0024-3795(89)90541-7zbMath0695.05044OpenAlexW2031986374MaRDI QIDQ909674

David L. Powers

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90541-7

zbMATH Keywords

surveynumber of verticesupper and lower estimateseigenvalue of a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

On the largest \(k\)th eigenvalues of trees, Minimizing the least eigenvalue of graphs with fixed order and size, Graphs for which the least eigenvalue is minimal. I, Extrema of graph eigenvalues, Eigenvalues of subgraphs of the cube, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), The least eigenvalue of a graph with a given domination number, Spectral conditions for the existence of specified paths and cycles in graphs

Cites Work

• Unnamed Item
• Bounds on graph spectra
• On the spectral radius of (0,1)-matrices
• The kth largest eigenvalue of a tree
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• On the maximal index of graphs with a prescribed number of edges
• Graph partitioning by eigenvectors
• The second largest eigenvalue of a tree
• A bound on the spectral radius of graphs with \(e\) edges