The minimum spectral radius of K_r + 1-saturated graphs

DOI10.1016/J.DISC.2020.112068MaRDI QIDQ2198388zbMATH OpenOpenAlexFDO

Authors Jaehoon Kim, Seog-Jin Kim, Suil O, Alexandr Kostochka

Publication date 10 September 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2020.112068

zbMATH Keywords

complete graphssaturated graphsspectral radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
• Saturation spectrum of paths and stars
• On the edge spectrum of saturated graphs for paths and stars
• The edge spectrum of K₄-saturated graphs
• The edge spectrum of the saturation number for small paths

Cites work

• A Problem in Graph Theory
• A survey of minimum saturated graphs
• Bounds on graph eigenvalues. II
• Graphs and Hermitian matrices: eigenvalue interlacing
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3214389 (Why is no real title available?)
• Quasi-random graphs
• Regular graphs. A spectral approach
• Spectral Radius and Degree Sequence
• The smallest eigenvalue of \(K_{r}\)-free graphs

Cited in

(11)

• The edge spectrum of \(K_4^-\)-saturated graphs
• The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
• A sharp lower bound for the spectral radius in \(K_4\)-saturated graphs
• A sufficient \(Q\)-spectral condition for a graph to be \(\beta\)-deficient involving minimum degree
• Saturation spectrum of paths and stars
• scientific article; zbMATH DE number 5280010 (Why is no real title available?)
• scientific article; zbMATH DE number 6792988 (Why is no real title available?)
• The minimum spectral radius for \(K_{r+1}\)-saturated graphs with \(r = 4\), 5
• Variable neighbourhood search for connected graphs of fixed order and size with minimal spectral radius
• Minimizing the number of complete bipartite graphs in a K_s-saturated graph
• The minimum spectral radius of tP₃- or K₅-saturated graphs via the number of 2-walks

This page was built for publication: The minimum spectral radius of \(K_{r + 1}\)-saturated graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198388)