On graphs with the smallest eigenvalue at least −1 − √2, part III
From MaRDI portal
Publication:5217093
DOI10.26493/1855-3974.1581.b47zbMath1433.05200OpenAlexW4255271304MaRDI QIDQ5217093
Kiyoto Yoshino, Sho Kubota, Tetsuji Taniguchi
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1581.b47
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (4)
On the Aα-spectral radius of connected graphs ⋮ Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \) ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey ⋮ Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
Uses Software
Cites Work
- The strong perfect graph theorem
- Line graphs, root systems, and elliptic geometry
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- Trivially perfect graphs
- The Magma algebra system. I: The user language
- On fat Hoffman graphs with smallest eigenvalue at least -3
- On graphs with the smallest eigenvalue at least −1 − √2, part I
- 1-Factors and Antifactor Sets
- Characterizations of derived graphs
This page was built for publication: On graphs with the smallest eigenvalue at least −1 − √2, part III
