Connected claw-free graphs whose second largest eigenvalue does not exceed 1

DOI10.1016/J.DISC.2026.115079MaRDI QIDQ7231832zbMATH OpenFDO

Authors Chaohui Chen, Hai-Ying Shan, Muhuo Liu, Zoran Stanić

Publication date 22 April 2026

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2026.115079

zbMATH Keywords

complementary graphforbidden induced subgraphgraph spectrumsecond largest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• An introduction to the theory of graph spectra
• Characterization of outerplanar graphs whose second largest eigenvalue is at most 1
• Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1
• Equiangular lines with a fixed angle
• Graphs with large clique number whose second largest eigenvalue does not exceed \((\sqrt{5}-1)/2\)
• Graphs with second largest eigenvalue less than 1/2
• scientific article; zbMATH DE number 3825855 (Why is no real title available?)
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• Inequalities for Graph Eigenvalues
• Multiplicity of  the second‐largest eigenvalue of a planar graph
• On graphs whose second largest eigenvalue is at most 1
• On the second largest eigenvalue of line graphs

Cited in

(1)

• On K₄-minor free graphs whose second largest eigenvalue does not exceed 1

This page was built for publication: Connected claw-free graphs whose second largest eigenvalue does not exceed 1

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