AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds of λ2 for general graphs and bipartite graphs, respectively. Considering that these bounds are not always attainable for connected graphs, we present sharp upper bounds of λ2 for connected graphs and connected bipartite graphs in this paper. Moreover, the extremal graphs are completely characterized
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
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 ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
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 ...
AbstractA generalized θ-graph, denoted by θn, is a graph consisting of n internal disjoint (u, v)-pa...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractConnected graphs in which the number of edges equals the number of vertices plus one are cal...
AbstractConnected graphs in which the number of edges equals the number of vertices are called unicy...
AbstractGraphs with second largest eigenvalue λ2⩽1 are extensively studied, however, whether they ar...
AbstractUpper and lower estimates are found for the maximum of the kth eigenvalue of a graph as a fu...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
AbstractIn this paper we determine the extremal graphs for which equality in de Caen's inequality ho...
AbstractGernert conjectured that the sum of two largest eigenvalues of the adjacency matrix of any s...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...