On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1

DOI10.1016/j.disc.2007.10.017zbMath1225.05162OpenAlexW1998994159MaRDI QIDQ998477

Mingfei Gao, Qiong Xiang Huang

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

eigenvalueinduced subgraphgeneralized \(\theta \)-graph

Mathematics Subject Classification ID

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

Related Items (9)

A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph ⋮ Spectral characterization of graphs whose second largest eigenvalue is less than 1 ⋮ Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Spectral characterization of the complete graph removing a cycle ⋮ On tricyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 ⋮ Unnamed Item ⋮ Spectral characterization of unicyclic graphs whose second largest eigenvalue does not exceed 1 ⋮ On graphs whose second largest eigenvalue is at most 1

Cites Work

• On graphs with exactly one eigenvalue less than -1
• The second largest eigenvalue of a tree
• On unicyclic graphs whose second largest eigenvalue does not exceed 1
• The largest eigenvalue of a graph: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1