Fat Hoffman graphs with smallest eigenvalue greater than -3
Combinatorics
2014-08-12 v4 Discrete Mathematics
Abstract
In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing with smallest eigenvalue greater than -3, where is the Hoffman graph having one slim vertex and two fat vertices.
Cite
@article{arxiv.1211.3929,
title = {Fat Hoffman graphs with smallest eigenvalue greater than -3},
author = {Akihiro Munemasa and Yoshio Sano and Tetsuji Taniguchi},
journal= {arXiv preprint arXiv:1211.3929},
year = {2014}
}
Comments
21+5 pages