AbstractLet G=(V,E) be a graph on vertex set V={v1,v2,…,vn}. For any vertex vi, we denote by N(vi) the set of the vertices adjacent to vi in G. Das got the following upper bound for Laplacian spectral radius:λ1(G)⩽max{|N(vi)∪N(vj)|:1⩽i<j⩽n,vivj∈E}.In this paper, we characterize all the connected graphs which achieve the above upper bound
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G=(V,E) be a graph on n vertices. Denote by di=d(vi) the degree of vi∈V(G). Thenλ(G)⩽max...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
Let G be a simple graph with n vertices and m edges and Gc be its complement. Let δ(G) = δ and �(G)...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
AbstractLet G=(V,E) be a graph on n vertices. Denote by di=d(vi) the degree of vi∈V(G). Thenλ(G)⩽max...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
Abstract. Let G =(V,E) be a simple connected graph with n vertices and e edges. Assume that the vert...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
The spectrum of the Laplacian matrix of a network plays a key role in a wide range of dynamical prob...
Let G be a simple graph with n vertices and m edges and Gc be its complement. Let δ(G) = δ and �(G)...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractThe Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
summary:The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplaci...
Let G be a simple connected graph with n vertices, m edges and degree sequence: d1 ≥ d2 · · · ≥ d...
AbstractLet G be a simple connected graph with n vertices, m edges and degree sequence: d1⩾d2⩾⋯⩾dn. ...
DOI
Add to ORKG