On graphs whose second largest eigenvalue is at most 1

DOI10.1016/j.ejc.2021.103385zbMath1469.05107OpenAlexW3175288272MaRDI QIDQ2048359

Muhuo Liu, Zoran Stanić, Chaohui Chen

Publication date: 5 August 2021

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

Full work available at URL: https://doi.org/10.1016/j.ejc.2021.103385

zbMATH Keywords

graph eigenvaluessecond largest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (5)

Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Spectral characterization of the complete graph removing a cycle ⋮ Graphs with second largest eigenvalue less than 1/2 ⋮ Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• 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 regular graphs and coronas whose second largest eigenvalue does not exceed 1
• On the second largest eigenvalue of line graphs
• Inequalities for Graph Eigenvalues
• Characterizations of derived graphs

This page was built for publication: On graphs whose second largest eigenvalue is at most 1