In this paper we observe that the minimal signless Laplacian spectral radius is obtained uniquely at the kite graph PKn−ω,ω among all connected graphs with n vertices and clique number ω. In addition, we show that the spectral radius μ of PKm,ω (m ≥ 1) satisfie
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
Abstract. We study the signless Laplacian spectral radius of graphs and prove three conjectures of C...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all conn...
AbstractIn this paper, we show that among all the connected graphs with n vertices and k cut vertice...
In this paper, we determine the graph with maximal signless Lapla-cian spectral radius among all con...
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 ...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacia...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
Abstract. We study the signless Laplacian spectral radius of graphs and prove three conjectures of C...
summary:In this paper, the upper and lower bounds for the quotient of spectral radius (Laplacian spe...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
In this paper, we determine the maximum signless Laplacian spectral radius of all graphs which do no...
In this paper, we determine the graph with maximal signless Laplacian spectral radius among all conn...
AbstractIn this paper, we show that among all the connected graphs with n vertices and k cut vertice...
In this paper, we determine the graph with maximal signless Lapla-cian spectral radius among all con...
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 ...
AbstractThe Laplacian spectral radius of a graph G is the largest eigenvalue of its Laplacian matrix...
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacia...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we characterize the graphs with maximum signless Laplacian or adjacency spect...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann lim...
Abstract. We study the signless Laplacian spectral radius of graphs and prove three conjectures of C...
DOI
Add to ORKG