AbstractIt is well known in the theory of graph spectra that connected graphs except for complete multipartite (including complete) graphs have the second largest eigenvalue greater than 0. Graphs whose second largest eigenvalue does not exceed 13 are characterized in Cao and Yuan (1993). In this paper we study the structure of graphs whose second largest eigenvalue does not exceed (√5−1)2
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
Abstract: The second largest eigenvalue (λ 2 ) provides significant information on characteristics a...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
Abstract: The second largest eigenvalue (λ 2 ) provides significant information on characteristics a...
The eigenvalues of a graph are those of its adjacency matrix. Recently, Cioabă, Haemers and Vermette...
AbstractWe show that every limit point of the kth largest eigenvalues of graphs is a limit point of ...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
Graphs with least eigenvalue greater than or equal to -2 are to a big extent studied by Hoffman and ...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...