AbstractLet G be a simple graph with vertices v1,v2,⋯,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. Let A be the (0,1)-adjacency matrix of G and D be the diagonal matrix diag(d1,d2,⋯,dn). Q(G)=D+A is called the signless Laplacian of G. In this paper, we give some sharp bounds on signless Laplacian spectral radius ρ(Q(G)) in terms of di
AbstractLet G=(V(G),E(G)) be a unicyclic simple undirected graph with largest vertex degree Δ. Let C...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ a...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, various modications of a connected graph G are regarded as perturbations of its signl...
AbstractLet G=(V,E) be a simple, undirected graph of order n and size m with vertex set V, edge set ...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractLet G be a connected graph of order n. The diameter of G is the maximum distance between any...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet G be a simple connected graph with V(G)={v1,v2,…,vn} and girth at least 5. Let Δ be the ...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
AbstractLet M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eig...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet G be a simple undirected graph. For v∈V(G), the 2-degree of v is the sum of the degrees ...
AbstractLet G=(V(G),E(G)) be a unicyclic simple undirected graph with largest vertex degree Δ. Let C...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ a...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
In this paper, various modications of a connected graph G are regarded as perturbations of its signl...
AbstractLet G=(V,E) be a simple, undirected graph of order n and size m with vertex set V, edge set ...
summary:Let $G$ be a graph with $n$ vertices, $m$ edges and a vertex degree sequence $(d_1, d_2, ...
AbstractLet G be a connected graph of order n. The diameter of G is the maximum distance between any...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet G be a simple connected graph with V(G)={v1,v2,…,vn} and girth at least 5. Let Δ be the ...
AbstractThe signless Laplacian spread of G is defined as SQ(G)=μ1(G)-μn(G), where μ1(G) and μn(G) ar...
AbstractLet M=(mij) be a nonnegative irreducible n×n matrix with diagonal entries 0. The largest eig...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet G be a simple undirected graph. For v∈V(G), the 2-degree of v is the sum of the degrees ...
AbstractLet G=(V(G),E(G)) be a unicyclic simple undirected graph with largest vertex degree Δ. Let C...
summary:Let $G$ be a simple connected graph of order $n$ with degree sequence $(d_1,d_2,\ldots ,d_...
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ a...