A bound on the spectral radius of graphs with \(e\) edges
From MaRDI portal
Publication:1821794
DOI10.1016/0024-3795(87)90172-8zbMath0617.05045MaRDI QIDQ1821794
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90172-8
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
The largest eigenvalue of a graph: A survey, Eigenvalues and degree deviation in graphs, Bounds on graph eigenvalues, Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph, A sharp upper bound on the spectral radius of weighted graphs, The least eigenvalue of graphs with given connectivity, A bound on the spectral radius of graphs, Bounds on the spectral radius of graphs with e edges, INGRID: A graph invariant manipulator, On the maximal index of graphs with a prescribed number of edges, Bounds of eigenvalues of graphs, A decreasing sequence of upper bounds for the Perron root, Bounds on eigenvalues and chromatic numbers, Sharp upper bounds on the spectral radius of graphs, Some new bounds on the spectral radius of graphs, A sharp upper bound of the spectral radius of graphs, Computers and discovery in algebraic graph theory, 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, From Graph Theory to Models of Economic Networks. A Tutorial
Cites Work
