Add to ORKGWe study nonregular graphs with three eigenvalues. We determine all the ones with least eigenvalue &2, and give new infinite families of examples. 1998 Academic Press 1
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
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 give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
1998 We prove some results on graphs with three eigenvalues, not all integral; these are a natural g...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
We give a combinatorial characterization of graphs whose normalized Laplacian has three distinct eig...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
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 give a combinatorial characterization of graphs whose normalized Laplacian has three dist...
Let G be a simple and undirected graph. The eigenvalues of the adjacency matrix of G are called the ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
1998 We prove some results on graphs with three eigenvalues, not all integral; these are a natural g...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
Abstract In this paper, we determine the unique graph whose least signless Laplacian eigenvalue atta...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
The family of minimal forbidden graphs for the set of graphs with all eigenvalues at least −2 is des...