Bounds on the spectral radius of graphs with e edges
From MaRDI portal
Publication:1111572
DOI10.1016/0024-3795(88)90144-9zbMath0658.05054MaRDI QIDQ1111572
Publication date: 1988
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(88)90144-9
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A42: Inequalities involving eigenvalues and eigenvectors
15A18: Eigenvalues, singular values, and eigenvectors
Related Items
Estimates of the spectral radius of graphs*, The largest eigenvalue of a graph: A survey, Bounds on expected hitting times for a random walk on a connected graph, A bound on the spectral radius of graphs, On the maximal index of graphs with a prescribed number of edges, On the maximal index of connected graphs, Bounds on eigenvalues and chromatic numbers
Cites Work