On graphs with the smallest eigenvalue at least −1 − √2, part I

DOI10.26493/1855-3974.35.FE9MaRDI QIDQ3535845zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

generalized line graphspectrum

Mathematics Subject Classification ID

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

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 - 2. II
• A generalization of a theorem of Hoffman
• Edge-signed graphs with smallest eigenvalue greater than \(-2\)

Cited in

(11)

• A generalization of a theorem of Hoffman
• Graphs with least eigenvalue \(-2\): a new proof of the 31 forbidden subgraphs theorem
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
• Mixed graphs with smallest eigenvalue greater than \(- \sqrt{3}\)
• Mixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)
• A structure theory for graphs with fixed smallest eigenvalue
• Fat Hoffman graphs with smallest eigenvalue greater than -3
• On graphs with the smallest eigenvalue at least -1 - 2. II
• Graphs with least eigenvalue -2: ten years on
• On graphs with the smallest eigenvalue at least \(-1 - \sqrt{2} \). III

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)