Add to ORKGAbstract. If G is a maximal exceptional graph then either (a) G is the cone over a graph switching-equivalent to the line graph L(K8) or (b) G has K8 as a star complement for the eigenvalue −2 (or both). In case (b) it is shown how G can be constructed from K8 using intersecting families of 3-sets. 1
summary:Let $G$ be a finite graph with an eigenvalue $\mu $ of multiplicity $m$. A set $X$ of $m$ ve...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a s...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
AbstractA graph is said to be exceptional if it is connected, has least eigenvalue greater than or e...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
AbstractIn this paper it is shown that, for any odd integer t>3, the line graph L(Kt) is the unique ...
AbstractIt was proved recently by one of the authors that, if H is a path Pt (t>2 with t≠7 or 8) or ...
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...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractLet μ be an eigenvalue of the graph G with multiplicity k. A star complement for μ in G is a...
AbstractStar complements are used to construct switching-equivalent graphs which share an eigenvalue...
AbstractSuppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal...
AbstractLet μ be an eigenvalue of the graph G with multiplicity m. A star complement for μ in G is a...
summary:Let $G$ be a finite graph with an eigenvalue $\mu $ of multiplicity $m$. A set $X$ of $m$ ve...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a s...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
AbstractA graph is said to be exceptional if it is connected, has least eigenvalue greater than or e...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
AbstractIn this paper it is shown that, for any odd integer t>3, the line graph L(Kt) is the unique ...
AbstractIt was proved recently by one of the authors that, if H is a path Pt (t>2 with t≠7 or 8) or ...
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...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
AbstractLet μ be an eigenvalue of the graph G with multiplicity k. A star complement for μ in G is a...
AbstractStar complements are used to construct switching-equivalent graphs which share an eigenvalue...
AbstractSuppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal...
AbstractLet μ be an eigenvalue of the graph G with multiplicity m. A star complement for μ in G is a...
summary:Let $G$ be a finite graph with an eigenvalue $\mu $ of multiplicity $m$. A set $X$ of $m$ ve...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a s...