AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this paper, all tricyclic graphs whose second largest eigenvalue does not exceed 1 are identified
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Abstract Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest La...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap. (...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
AbstractIt is well known in the theory of graph spectra that connected graphs except for complete mu...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
We study nonregular graphs with three eigenvalues.We determine all the ones with least eigenvalue -2...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
Abstract Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest La...
AbstractWe study nonregular graphs with three eigenvalues. We determine all the ones with least eige...
Among all trivalent graphs on n vertices, let Gn be one with the smallest possible eigenvalue gap. (...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
This paper determines all nonsingular unicyclic mixed graphs on at least nine vertices with at most ...
DOI
Add to ORKG