Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the join of a complete graph of order k and an independent set of order n-k. In this note, it is shown that Sn,k is extremal for some spectral parameters of G as well. More precisely, letting μ (H) and q (H) denote the largest eigenvalues of the adjacency matrix and the signless Laplacian of a graph H, the inequalities μ(G)\u3cμ(Sn,k) and q(G
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. I...
Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A,...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
This paper gives tight upper bounds on the largest eigenvalue q (G) of the signless Laplacian of gra...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
Let q (G) denote the spectral radius of the signless Laplacian matrix of a graph G, also known as th...
Abstract. This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplaci...
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of grap...
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractThe Q-index of a simple graph G is the largest eigenvalue of the matrix Q, the signless Lapl...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. I...
Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A,...
Let G be a k-degenerate graph of order n. It is well-known that G has no more edges than Sn,k, the j...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. L...
This paper gives tight upper bounds on the largest eigenvalue q (G) of the signless Laplacian of gra...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
Let q (G) denote the spectral radius of the signless Laplacian matrix of a graph G, also known as th...
Abstract. This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplaci...
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of grap...
This paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
AbstractLet AG and DG be respectively the adjacency matrix and the degree matrix of a graph G. The s...
AbstractThe Q-index of a simple graph G is the largest eigenvalue of the matrix Q, the signless Lapl...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplacian of G. I...
Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A,...
DOI
Add to ORKG