For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenvalues. By considering the relation between the Q-spectrum and the circumference of G, we characterize all connected graphs with exactly three Q-eigenvalues at least two
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenv...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Abstract. Let G be a connected simple graph. The relationship between the third smallest eigenvalue ...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also kn...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
For a graph G, we here investigate its signless Laplacian matrix Q(G) and the corresponding Q-eigenv...
In this paper, we investigate the relation between the Q-spectrum and the structure of G in terms of...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
In this paper we consider the graphs having at most two (signless) Laplacian eigenvalues greater tha...
AbstractIn this paper, all connected graphs with the fourth largest Laplacian eigenvalue less than t...
AbstractIn this paper, all connected bipartite graphs are characterized whose third largest Laplacia...
For a graph G, let the signless Laplacian matrix Q(G) defined as Q(G)=D(G)+A(G), where A(G) and D(G)...
Abstract. Let G be a connected simple graph. The relationship between the third smallest eigenvalue ...
Let Γ=(G,σ) be a signed graph, where G is the underlying graph and σ:E(G)→{+,-} is the signature fun...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
Let G be a graph of order n, and let q1(G)≥⋯≥q n(G) be the eigenvalues of the Q-matrix of G, also kn...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
Let G be a simple graph with n vertices. The characteristic polynomial det(xI − A) of a (0,1)-adjace...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
DOI
Add to ORKG