AbstractIt is shown that the second largest eigenvalue of the adjacency matrix of any d-regular graph G containing two edges the distance between which is at least 2k + 2 is at least 2d − 1 − (2d − 1 − 1)/(k+1)
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
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)...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
AbstractIn this paper, we classify distance regular graphs such that all of its second largest local...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
An upper bound is given on the minimum distance between i subsets of same size of a regular graph in...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
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)...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
AbstractIn this paper, we classify distance regular graphs such that all of its second largest local...
We characterize the simple connected graphs with the second largest eigenvalue less than 1/2, which ...
AbstractWe determine all trees whose second largest eigenvalue does not exceed 2. Next, we consider ...
An upper bound is given on the minimum distance between i subsets of same size of a regular graph in...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractVery little is known about lower bounds and upper bounds for the second largest Laplacian ei...
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of...
Let G = (V;E) be a simple, undirected graph with maximum and minimum degree ∆ and respectively, and ...
AbstractLet λ2 be the second largest eigenvalue of a graph. Powers (1988) [4] gave some upper bounds...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Let G be a graph of order n. The second stage adjacency matrix of G is the symmetric n × n matrix fo...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
DOI
Add to ORKG