Publication date
January 2010
DOI Publisher
Elsevier Inc. ISSN
0024-3795 Citation count (estimate)
35Abstract
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existence of Hamiltonian paths and cycles
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existence of Hamiltonian paths and cycles
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existe...
AbstractLet G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let ...
During the last decade several research groups have published results on sufficient conditions for t...
summary:Let $G$ be a graph of order $n$ and $\lambda ( G) $ the spectral radius of its adjacency mat...
AbstractA graph is said to have a small spectral radius if it does not exceed the corresponding Hoff...
Let G be a graph of order n and μ (G) be the largest eigenvalue of its adjacency matrix. Let over(G,...
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ a...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present s...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractWe give tight conditions on the signless Laplacian spectral radius of a graph for the existe...
AbstractLet G be a graph of order n and μ(G) be the largest eigenvalue of its adjacency matrix. Let ...
During the last decade several research groups have published results on sufficient conditions for t...
summary:Let $G$ be a graph of order $n$ and $\lambda ( G) $ the spectral radius of its adjacency mat...
AbstractA graph is said to have a small spectral radius if it does not exceed the corresponding Hoff...
Let G be a graph of order n and μ (G) be the largest eigenvalue of its adjacency matrix. Let over(G,...
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph of order $n$, where $D(G)$ a...
AbstractIn the paper, we identify graphs with the maximal signless Laplacian spectral radius among a...
AbstractThe spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph an...
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present s...
AbstractLet G be a graph with n vertices and μ(G) be the largest eigenvalue of the adjacency matrix ...
AbstractLet G be a simple graph with vertices v1,v2,…,vn, of degrees Δ=d1⩾d2⩾⋯⩾dn=δ, respectively. L...
AbstractIn this paper, we investigate the properties of the largest signless Laplacian spectral radi...
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian mat...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Add to ORKG