Title of article
The Maximal Exceptional Graphs
Author/Authors
Cvetkovi?، نويسنده , , D. and Lepovi?، نويسنده , , M. and Rowlinson، نويسنده , , P. and Simi?، نويسنده , , S.K.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
17
From page
347
To page
363
Abstract
A graph is said to be exceptional if it is connected, has least eigenvalue greater than or equal to −2, and is not a generalized line graph. Such graphs are known to be representable in the exceptional root system E8. We determine the maximal exceptional graphs by a computer search using the star complement technique, and then show how they can be found by theoretical considerations using a representation of E8 in R8. There are exactly 473 maximal exceptional graphs.
Keywords
graph , Eigenvalue , star complement , root system.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2002
Journal title
Journal of Combinatorial Theory Series B
Record number
1527105
Link To Document