AbstractLet μ be an eigenvalue of the graph G with multiplicity k. A star complement for μ in G is an induced subgraph H=G−X such that |X|=k and μ is not an eigenvalue of G−X. Various graphs related to (generalized) line graphs or their complements are characterized by star complements corresponding to eigenvalues −2 or 1
We determine all the finite regular graphs which have an induced matching or a cocktail party graph ...
Suppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal stro...
Let G be a connected cubic graph of order n with μ as an eigenvalue of multiplicity k. We show that ...
AbstractLet μ be an eigenvalue of the graph G with multiplicity m. A star complement for μ in G is a...
AbstractLet μ be an eigenvalue of the graph G with multiplicity k. A star complement for μ in G is a...
AbstractLet G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigen...
Let G be a finite graph of order n with an eigenvalue ? of multiplicity k. (Thus the ?-eigenspace of...
Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called...
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a s...
Let $G$ be a graph of order $n$ and $\mu$ be an adjacency eigenvalue of $G$ with multiplicity $k\geq...
AbstractWe survey results concerning star complements in finite regular graphs, and note the connect...
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 ...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
We survey results concerning star complements in finite regular graphs, and note the connection with...
We determine all the finite regular graphs which have an induced matching or a cocktail party graph ...
Suppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal stro...
Let G be a connected cubic graph of order n with μ as an eigenvalue of multiplicity k. We show that ...
AbstractLet μ be an eigenvalue of the graph G with multiplicity m. A star complement for μ in G is a...
AbstractLet μ be an eigenvalue of the graph G with multiplicity k. A star complement for μ in G is a...
AbstractLet G be a finite graph of order n with an eigenvalue μ of multiplicity k. (Thus the μ-eigen...
Let G be a finite graph of order n with an eigenvalue ? of multiplicity k. (Thus the ?-eigenspace of...
Let G be a finite graph with an eigenvalue μ of multiplicity m. A set X of m vertices in G is called...
Let μ be an eigenvalue of the graph G with multiplicity k. A star set corresponding to μ in G is a s...
Let $G$ be a graph of order $n$ and $\mu$ be an adjacency eigenvalue of $G$ with multiplicity $k\geq...
AbstractWe survey results concerning star complements in finite regular graphs, and note the connect...
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 ...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
We survey results concerning star complements in finite regular graphs, and note the connection with...
We determine all the finite regular graphs which have an induced matching or a cocktail party graph ...
Suppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal stro...
Let G be a connected cubic graph of order n with μ as an eigenvalue of multiplicity k. We show that ...