The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the successful use of star complements to complete the classification of graphs with least eigenvalue −2. Guided by citations of the book, we survey progress in this area over the past decade. Some new observations are included
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
This paper provides a contribution to the study the phenomenon of cospectrality in generalized line ...
Abstract. A new proof concerning the determinant of the adjacency matrix of the line graph of a tree...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
给出了第二大特征值不超过 5 - 12 的所有连通线图 ,它们包括三大类和十个特殊情形The connected line graphs with the second largest eigenva...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
The authors' monographSpectral Generalizations of Line Graphswas published in 2004, following the su...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
We use star complement technique to construct a basis for −2 of signed line graphs using their root ...
This paper provides a contribution to the study the phenomenon of cospectrality in generalized line ...
Abstract. A new proof concerning the determinant of the adjacency matrix of the line graph of a tree...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
AbstractWe survey the main results of the theory of graphs with least eigenvalue −2 starting from la...
Main result: If the smallest eigenvalue of a graph H exceeds a fixed number larger than the smallest...
给出了第二大特征值不超过 5 - 12 的所有连通线图 ,它们包括三大类和十个特殊情形The connected line graphs with the second largest eigenva...
AbstractThe star complement technique is a spectral tool recently developed for constructing some bi...
Suppose that Tnc is a set, such that the elements of Tnc are the complements of trees of order n. In...
The star complement technique is a spectral tool recently developed for constructing some bigger gra...