2015年1月
Edge-signed graphs with smallest eigenvalue greater than - 2
JOURNAL OF COMBINATORIAL THEORY SERIES B
- ,
- ,
- ,
- ,
- 巻
- 110
- 号
- 開始ページ
- 90
- 終了ページ
- 111
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1016/j.jctb.2014.07.006
- 出版者・発行元
- ACADEMIC PRESS INC ELSEVIER SCIENCE
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. (C) 2014 Elsevier Inc. All rights reserved.
- リンク情報
- ID情報
-
- DOI : 10.1016/j.jctb.2014.07.006
- ISSN : 0095-8956
- eISSN : 1096-0902
- Web of Science ID : WOS:000346392400006