Bounds of eigenvalues of graphs

DOI10.1016/0012-365X(93)90007-GzbMath0788.05067MaRDI QIDQ1313968

Yuan Hong

Publication date: 1 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

eigenvalues; bounds; adjacency matrix

Mathematics Subject Classification ID

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

Related Items

The new upper bounds on the spectral radius of weighted graphs, Extremal graph characterization from the bounds of the spectral radius of weighted graphs, Bounds on graph eigenvalues. I, Spectral radii of graphs with given chromatic number, A sharp upper bound on the spectral radius of weighted graphs, The least eigenvalue of graphs with given connectivity, Some new bounds on the spectral radius of graphs, On maximal entries in the principal eigenvector of graphs, A new upper bound for the spectral radius of graphs with girth at least 5, Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spektren endlicher Grafen
• Bounds on graph spectra
• On the spectral radius of (0,1)-matrices
• The kth largest eigenvalue of a tree
• Inverses of trees
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• A bound on the spectral radius of graphs
• Graph partitioning by eigenvectors
• Sharp lower bounds on the eigenvalues of trees
• Bounds on the \(k\)th eigenvalues of trees and forests
• Recent results in the theory of graph spectra
• A bound on the spectral radius of graphs with \(e\) edges
• Bounds of eigenvalues of a graph
• The largest eigenvalue of a graph: A survey