Pages that link to "Item:Q1111572"

The following pages link to Bounds on the spectral radius of graphs with e edges (Q1111572):

Displaying 13 items.

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