Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1

DOI10.1016/j.ejc.2023.103775zbMath1525.05114MaRDI QIDQ6081104

Zoran Stanić, Muhuo Liu, Chaohui Chen

Publication date: 25 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

eigenvaluebipartite graphsminimal graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• On graphs whose second largest eigenvalue equals 1 -- the star complement technique
• Eigenvalue multiplicity in triangle-free graphs
• On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1
• On nested split graphs whose second largest eigenvalue is less than 1
• On graphs with exactly one eigenvalue less than -1
• The second largest eigenvalue of a tree
• On graphs whose second largest eigenvalue is at most 1
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The smallest eigenvalue of \(K_{r}\)-free graphs
• Cliques and the spectral radius
• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• On the second largest eigenvalue of line graphs
• Eigenvalues and triangles in graphs
• Inequalities for Graph Eigenvalues
• Characterizations of derived graphs

This page was built for publication: Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1