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 known as the signless Laplacian of G. We give a necessary and sufficient condition for the equality qk(G)=n-2, where
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...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
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...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
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)...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
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...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
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...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
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)...
AbstractLet G be a simple graph with n vertices. The matrix L(G)=D(G)−A(G) is called the Laplacian o...
AbstractWe study extremal graphs for the extremal values of the second largest Q-eigenvalue of a con...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
In this paper, we consider the signless Laplacians of simple graphs and we give some eigenvalue ineq...
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...
We show several sharp upper and lower bounds for the sum of the largest eigenvalues of the signless ...
Abstract. We extend our previous survey of properties of spectra of signless Laplacians of graphs. S...
DOI
Add to ORKG