AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-paths, where 2≤n<∞. In this paper, all generalized θ-graphs whose second largest eigenvalues do not exceed 1 have been determined
Abstract: The second largest eigenvalue (λ 2 ) provides significant information on characteristics a...
In this section we will first define the second eigenvalue of 3-uniform hypergraph, and then discuss...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
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...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the ...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the ...
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...
In this section we will first define the second eigenvalue of 3-uniform hypergraph, and then discuss...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
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...
We classify the connected graphs with precisely three distinct eigenvalues and second largest eigenv...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ₂(G) and the ...
AbstractIn this paper we consider graphs with three distinct eigenvalues and, we characterize those ...
AbstractLet λ1(G)⩾⋯⩾λn(G) be the eigenvalues of a graph G. We explore the distribution of eigenvalue...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
AbstractA tricyclic graph of order n is a connected graph with n vertices and n+2 edges. In this pap...
Let G be a mixed graph. We discuss the relation between the second largest eigenvalue λ2(G) and the ...
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...
In this section we will first define the second eigenvalue of 3-uniform hypergraph, and then discuss...
AbstractIn this paper all connected bipartite graphs whose second largest eigenvalue does not exceed...
DOI
Add to ORKG