AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among all the unicyclicgraphs with n vertices of diameter d
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
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...
[[abstract]]By the signless Laplacian of a (simple) graphG we mean the matrix Q(G) = D(G)+A(G), wher...
For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signle...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
summary:In this paper, the effects on the signless Laplacian spectral radius of a graph are studied ...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractIn this paper, we give a complete characterization of the extremal graphs with maximal Lapla...
AbstractIn this paper, we consider the following problem: of all tricyclic graphs or trees of order ...
AbstractIn the paper, we will determine graphs with the maximal spectral radius among all the unicyc...
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...
[[abstract]]By the signless Laplacian of a (simple) graphG we mean the matrix Q(G) = D(G)+A(G), wher...
For a k-graph H = (V(H), E(H)), let B(H) be its incidence matrix, and Q(H) = B(H)B(H)T be its signle...
AbstractIn this paper, we give some results on Laplacian spectral radius of graphs with cut vertices...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractA unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo S...
AbstractTricyclic graphs are connected graphs in which the number of edges equals the number of vert...
DOI
Add to ORKG