AbstractA 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
This paper summarizes the known results on graphs with smallest eigenvalue around -2, and completes ...
Let G be a graph of order n with an eigenvalue μ≠-1,0 of multiplicity k<n-2. It is known th...
In this paper we study the conditions under which the stability number of line graphs, generalized l...
AbstractA graph is said to be exceptional if it is connected, has least eigenvalue greater than or e...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
Abstract. If G is a maximal exceptional graph then either (a) G is the cone over a graph switching-e...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
Available from British Library Document Supply Centre-DSC:8723.4018(CSM-156) / BLDSC - British Libra...
In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has lea...
Let G be a finite graph of order n with an eigenvalue ? of multiplicity k. (Thus the ?-eigenspace of...
AbstractLet G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigen...
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is...
AbstractA maximal graph is a connected graph with degree sequence not majorized by the degree sequen...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractIn this paper it is shown that, for any odd integer t>3, the line graph L(Kt) is the unique ...
This paper summarizes the known results on graphs with smallest eigenvalue around -2, and completes ...
Let G be a graph of order n with an eigenvalue μ≠-1,0 of multiplicity k<n-2. It is known th...
In this paper we study the conditions under which the stability number of line graphs, generalized l...
AbstractA graph is said to be exceptional if it is connected, has least eigenvalue greater than or e...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
Abstract. If G is a maximal exceptional graph then either (a) G is the cone over a graph switching-e...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
Available from British Library Document Supply Centre-DSC:8723.4018(CSM-156) / BLDSC - British Libra...
In spectral graph theory a graph with least eigenvalue 2 is exceptional if it is connected, has lea...
Let G be a finite graph of order n with an eigenvalue ? of multiplicity k. (Thus the ?-eigenspace of...
AbstractLet G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigen...
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is...
AbstractA maximal graph is a connected graph with degree sequence not majorized by the degree sequen...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractIn this paper it is shown that, for any odd integer t>3, the line graph L(Kt) is the unique ...
This paper summarizes the known results on graphs with smallest eigenvalue around -2, and completes ...
Let G be a graph of order n with an eigenvalue μ≠-1,0 of multiplicity k<n-2. It is known th...
In this paper we study the conditions under which the stability number of line graphs, generalized l...
DOI
Add to ORKG