抄録
We give a structural classification of edge-signed graphs with smallest eigenvalue greater than -2. We prove a conjecture of Hoffman about the smallest eigenvalue of the line graph of a tree that was stated in the 1970s. Furthermore, we prove a more general result extending Hoffman's original statement to all edge-signed graphs with smallest eigenvalue greater than -2. Our results give a classification of the special graphs of fat Hoffman graphs with smallest eigenvalue greater than -3.
本文言語 | English |
---|---|
ページ(範囲) | 90-111 |
ページ数 | 22 |
ジャーナル | Journal of Combinatorial Theory. Series B |
巻 | 110 |
DOI | |
出版ステータス | Published - 2015 1月 1 |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- 離散数学と組合せ数学
- 計算理論と計算数学