The following pages link to (Q5644003):
Displaying 19 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Open problems on graph eigenvalues studied with AutoGraphiX (Q743636) (← links)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph (Q932184) (← links)
- Some results on the bounds of signless Laplacian eigenvalues (Q2017701) (← links)
- Nordhaus-Gaddum-type results for path covering and \(L(2,1)\)-labeling numbers (Q2253966) (← links)
- A sharp upper bound for the number of spanning trees of a graph (Q2478168) (← links)
- A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size (Q2668072) (← links)
- Trees with small spectral gap (Q3174804) (← links)
- The largest eigenvalue of a graph: A survey (Q4713877) (← links)
- Eigenvalues and triangles in graphs (Q4993261) (← links)
- Spectral radius and Hamiltonian properties of graphs, II (Q5133410) (← links)
- On a generalization of the spectral Mantel's theorem (Q6053965) (← links)
- Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) (Q6063277) (← links)
- A Spectral Erdős-Sós Theorem (Q6072289) (← links)
- Refinement on Spectral Turán’s Theorem (Q6081801) (← links)
- Maximum degree and spectral radius of graphs in terms of size (Q6154430) (← links)
- Spectral Turán problems for intersecting even cycles (Q6187353) (← links)
- Factors, spectral radius and toughness in bipartite graphs (Q6559405) (← links)
- The spectral even cycle problem (Q6615499) (← links)
