AbstractWe show that if μj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1⩽j⩽n) of a connected graph Γ on n vertices, then μj⩾dj-j+2(1⩽j⩽n-1). This settles a conjecture due to Guo
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
If μm and dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex...
AbstractWe show that if μj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree...
A lower bound for the Laplacian eigenvalues of a graph—proof of a conjecture by Gu
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
We show that if μj is the j-th largest Laplacian eigenvalue, and dj is the j-th largest degree (1 j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
We show that if µj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree (1 = j ...
If μm and dm denote, respectively, the m-th largest Laplacian eigenvalue and the m-th largest vertex...
AbstractWe show that if μj is the jth largest Laplacian eigenvalue, and dj is the jth largest degree...
A lower bound for the Laplacian eigenvalues of a graph—proof of a conjecture by Gu
AbstractIn this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalu...
AbstractLet G=(V,E) be a simple graph on vertex set V={v1,v2,…,vn}. Further let di be the degree of ...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractSeveral upper bounds on the largest Laplacian eigenvalue of a graph G, in terms of degree an...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
AbstractLet G=(V,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. ...
DOI
Add to ORKG