On graphs with the smallest eigenvalue at least −1 − √2, part I
From MaRDI portal
Publication:3535845
DOI10.26493/1855-3974.35.FE9zbMATH Open1168.05333OpenAlexW4242743427MaRDI QIDQ3535845FDOQ3535845
Authors: Tetsuji Taniguchi 
Publication date: 14 November 2008
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.35.fe9
Recommendations
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt 2\). II
- A generalization of a theorem of Hoffman
- Edge-signed graphs with smallest eigenvalue greater than \(-2\)
Cited In (10)
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt 2\). II
- Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
- Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
- A generalization of a theorem of Hoffman
- A structure theory for graphs with fixed smallest eigenvalue
- On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III
- Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
- Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
- Graphs with least eigenvalue \(-2\): ten years on
This page was built for publication: On graphs with the smallest eigenvalue at least −1 − √2, part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3535845)
