Mathematics – Combinatorics
Scientific paper
2011-11-30
Mathematics
Combinatorics
19 pages, 10 figures
Scientific paper
In this paper, we show that all fat Hoffman graphs with smallest eigenvalue at least -1-\tau, where \tau is the golden ratio, can be described by a finite set of fat (-1-\tau)-irreducible Hoffman graphs. In the terminology of Woo and Neumaier, we mean that every fat Hoffman graph with smallest eigenvalue at least -1-\tau is an H-line graph, where H is the set of isomorphism classes of maximal fat (-1-\tau)-irreducible Hoffman graphs. It turns out that there are 37 fat (-1-\tau)-irreducible Hoffman graphs, up to isomorphism.
Munemasa Akihiro
Sano Yoshio
Taniguchi Tetsuji
No associations
LandOfFree
Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$ 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 Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fat Hoffman graphs with smallest eigenvalue at least $-1-τ$ will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-9453