Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)
From MaRDI portal
Publication:403567
DOI10.1016/j.dam.2014.01.008zbMath1298.05205arXiv1211.3929OpenAlexW2107351180MaRDI QIDQ403567
Tetsuji Taniguchi, Akihiro Munemasa, Yoshio Sano
Publication date: 29 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.3929
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)
Related Items (3)
Edge-signed graphs with smallest eigenvalue greater than \(-2\) ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limit points of the smallest eigenvalues of regular graphs
- On spectral characterization and embeddings of graphs
- Distance-hereditary graphs
- Line graphs, root systems, and elliptic geometry
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
- On fat Hoffman graphs with smallest eigenvalue at least -3
- Fat Hoffman graphs with smallest eigenvalue at least −1 − τ
- On graphs with the smallest eigenvalue at least −1 − √2, part I
- A Characterization of Block-Graphs
- The Change in the Least Eigenvalued of the Adjacency Matrix of a Graph Under Imbedding
This page was built for publication: Fat Hoffman graphs with smallest eigenvalue greater than \(-3\)