Pages that link to "Item:Q1057342"
From MaRDI portal
The following pages link to On the spectral radius of (0,1)-matrices (Q1057342):
Displayed 26 items.
- Bounds on graph eigenvalues (Q909674) (← links)
- Unoriented Laplacian maximizing graphs are degree maximal (Q932145) (← links)
- A sharp upper bound on the spectral radius of weighted graphs (Q932586) (← links)
- On an upper bound of the spectral radius of graphs (Q998412) (← links)
- The least eigenvalue of graphs with given connectivity (Q999814) (← links)
- The majorization theorem of connected graphs (Q1030719) (← links)
- Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs (Q1035554) (← links)
- The maximal eigenvalue of 0-1 matrices with prescribed number of ones (Q1066234) (← links)
- On the minimum spectral radius of matrices of zeros and ones (Q1087959) (← links)
- A bound on the spectral radius of graphs (Q1109050) (← links)
- Bounds on the spectral radius of graphs with e edges (Q1111572) (← links)
- On the maximal index of graphs with a prescribed number of edges (Q1116954) (← links)
- On Hamiltonian graphs with maximal index (Q1123901) (← links)
- On the maximal index of connected graphs (Q1174310) (← links)
- Bounds of eigenvalues of graphs (Q1313968) (← links)
- Bounds on eigenvalues and chromatic numbers (Q1377497) (← links)
- Sharp upper bounds on the spectral radius of graphs (Q1418981) (← links)
- A bound on the spectral radius of graphs with \(e\) edges (Q1821794) (← links)
- Some new bounds on the spectral radius of graphs (Q1827705) (← links)
- A sharp upper bound of the spectral radius of graphs (Q1850520) (← links)
- Spectral radius of non-negative matrices and digraphs (Q1862883) (← links)
- A new upper bound for the spectral radius of graphs with girth at least 5 (Q2369050) (← links)
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones (Q3718752) (← links)
- Some extremal problems concerning the square of a (0,1)-matrix (Q3778115) (← links)
- Tricylic hamiltonian graphs with minimal index (Q4322536) (← links)
- The largest eigenvalue of a graph: A survey (Q4713877) (← links)