论文信息 - On fat Hoffman graphs with smallest eigenvalue at least -3

On fat Hoffman graphs with smallest eigenvalue at least -3

We investigate fat Hoffman graphs with smallest eigenvalue at least −3 , using their special graphs. We show that the special graph S ( H o ) of an indecomposable fat Hoffman graph H o 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 o ) is isomorphic to one of the Dynkin graphs A n , D n , or extended Dynkin graphs A n or D n .

[1] Charles R. Johnson,et al. Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[2] Dragoš Cvetković,et al. Spectral Generalizations of Line Graphs: On Graphs with Least Eigenvalue -2 , 2004 .

[3] A. Hoffman. On graphs whose least eigenvalue exceeds − 1 − √2 , 1977 .

[4] L. Lovász. Combinatorial problems and exercises , 1979 .

[5] A. Neumaier,et al. On graphs whose smallest eigenvalue is at least − 1 − √2 , 1995 .

[6] Hyonju Yu,et al. On the limit points of the smallest eigenvalues of regular graphs , 2011, Des. Codes Cryptogr..

[7] Michael Doob,et al. Generalized line graphs , 1981, J. Graph Theory.

[8] Wolfgang Ebeling,et al. Lattices and Codes: A Course Partially Based on Lectures by Friedrich Hirzebruch , 1994 .

[9] J. Seidel,et al. Line graphs, root systems, and elliptic geometry , 1976 .

[10] Peter J. Cameron,et al. Signed Graphs, Root Lattices, and Coxeter Groups , 1994 .

[11] Tetsuji Taniguchi,et al. On graphs with the smallest eigenvalue at least -1 - √2, part I , 2008, Ars Math. Contemp..