Mathematics – Combinatorics
Scientific paper
2011-10-31
Mathematics
Combinatorics
21 pages
Scientific paper
Hoffman graphs are a limiting object of graphs with respect to the smallest eigenvalue. To understand graphs with smallest eigenvalue -3, we investigate fat Hoffman graphs with smallest eigenvalue at least -3, using their special graphs. We show that the special graph S(H) of an indecomposable fat Hoffman graph H is represented by the standard lattice or an irreducible root lattice. Moreover, we show that if the special graph admits an integral representation, that is, the lattice spanned by it is not an exceptional root lattice, then the special graph S^-(H) is isomorphic to one of the Dynkin graphs A_n, D_n, or extended Dynkin graphs tilde{A}_n or tilde{D}_n.
Jang Hye Jin
Koolen Jack
Munemasa Akihiro
Taniguchi Tetsuji
No associations
LandOfFree
On fat Hoffman graphs with smallest eigenvalue at least -3 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On fat Hoffman graphs with smallest eigenvalue at least -3, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On fat Hoffman graphs with smallest eigenvalue at least -3 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-147975