Bounds on graph eigenvalues. I

DOI10.1016/j.laa.2006.08.020zbMath1109.05073arXivmath/0602027MaRDI QIDQ861032

Vladimir Nikiforov

Publication date: 9 January 2007

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

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

zbMATH Keywords

spectral radius; girth; Laplacian; domination number

Mathematics Subject Classification ID

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

15A42: Inequalities involving eigenvalues and eigenvectors

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER, A sharp upper bound on algebraic connectivity using domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds of Laplacian spectrum of graphs based on the domination number
• Laplace eigenvalues of graphs---a survey
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• Bounds of eigenvalues of graphs
• Bounds on eigenvalues and chromatic numbers
• Two sharp upper bounds for the Laplacian eigenvalues.
• Sharp upper bounds on the spectral radius of graphs
• On the spectral radius of graphs
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• Some new bounds on the spectral radius of graphs
• A sharp upper bound of the spectral radius of graphs
• Sharp upper bounds for the Laplacian graph eigenvalues
• A new upper bound for the spectral radius of graphs with girth at least 5
• Some Inequalities for the Largest Eigenvalue of a Graph
• On Moore Graphs with Diameters 2 and 3
• Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
• The Laplacian Spectrum of a Graph II