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
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
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 &...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
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...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
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...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
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 &...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
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...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
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...
AbstractWe prove some results on graphs with three eigenvalues, not all integral; these are a natura...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
In this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establ...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...