Bounds on the spectral radius of graphs with e edges

DOI10.1016/0024-3795(88)90144-9zbMath0658.05054OpenAlexW1989762370MaRDI QIDQ1111572

Shmuel Friedland

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

zbMATH Keywords

spectral radiusadjacency matrixgraph eigenvalue

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

A bound on the spectral radius of graphs ⋮ Estimates of the spectral radius of graphs^* ⋮ On the maximal index of graphs with a prescribed number of edges ⋮ Bounds on eigenvalues and chromatic numbers ⋮ Counterexamples of the Bhattacharya-Friedland-Peled conjecture ⋮ Bounds on expected hitting times for a random walk on a connected graph ⋮ On the maximal index of connected graphs ⋮ A bound on the spectral radius of hypergraphs with \(e\) edges ⋮ Connected graphs of fixed order and size with maximal index: some spectral bounds ⋮ Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case ⋮ Turán's theorem implies Stanley's bound ⋮ The largest eigenvalue of a graph: A survey ⋮ Spectral radius of bipartite graphs

Cites Work

• On the spectral radius of (0,1)-matrices
• The maximal eigenvalue of 0-1 matrices with prescribed number of ones
• A bound on the spectral radius of graphs with \(e\) edges