The minimum spectral radius for K_r+1-saturated graphs with r = 4, 5
From MaRDI portal
Publication:6570040
DOI10.1016/J.DISC.2024.114110zbMATH Open1543.05123MaRDI QIDQ6570040FDOQ6570040
Authors: Dijian Wang, Yaoping Hou
Publication date: 10 July 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- The spectral radius of graphs without paths and cycles of specified length
- Title not available (Why is that?)
- The history of degenerate (bipartite) extremal graph problems
- A survey of minimum saturated graphs
- A Problem in Graph Theory
- Bounds on graph eigenvalues. II
- Spectral bounds for the clique and independence numbers of graphs
- Spectral extrema for graphs: the Zarankiewicz problem
- Spectral extrema of graphs: forbidden hexagon
- A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
- The minimum spectral radius of \(K_{r + 1}\)-saturated graphs
- Eine Extremalaufgabe aus der Graphentheorie.
This page was built for publication: The minimum spectral radius for \(K_{r+1}\)-saturated graphs with \(r = 4\), 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570040)