DOIAbstract
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue −2, and give new infinite families of examples
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue −2, and give new infinite families of examples
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
We study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
AbstractWe give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractWe continue our investigation of graphs G for which the least eigenvalue λ(G) is minimal amo...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
AbstractThe family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −...
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
Add to ORKG