Bounds of the spectral radius of connected graphs
From MaRDI portal
Recommendations
Cited in
(16)- A bound on the spectral radius of graphs
- Bounds on the spectral radius of graphs with e edges
- Spectral radius and \(k\)-connectedness of a graph
- A bound on the spectral radius of graphs with \(e\) edges
- Some upper bounds on the spectral radius of a graph
- Sharp upper bounds of the spectral radius of a graph
- Spectral bisection of graphs and connectedness
- Connected hypergraphs with small spectral radius
- Some lower bounds on the spectral radius of graphs.
- Bounds for the spectral radius of a graph when nodes are removed
- scientific article; zbMATH DE number 1279785 (Why is no real title available?)
- Spectral radius of graphs
- A new upper bound for the spectral radius of Halin graphs and the extremal graphs
- An upper bound on the spectral radius of oriented graphs
- Bounds of the spectral radius of connected graphs
- scientific article; zbMATH DE number 7690926 (Why is no real title available?)
This page was built for publication: Bounds of the spectral radius of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110246)