Add to ORKGAbstract. This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of graphs with no paths of given order. Thus, let Sn,k be the join of a complete graph of order k and an independent set of order n − k, and let S+ n,k be the graph obtained by adding an edge to Sn,k. The main result of the paper is the following theorem: Let k ≥ 1, n ≥ 7k2, and let G be a graph of order n. (i) If q (G) ≥
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of grap...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
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 paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
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. I...
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...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...
This paper gives tight upper bound on the largest eigenvalue q (G) of the signless Laplacian of grap...
This note presents a new spectral version of the graph Zarankiewicz problem: How large can be the ma...
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 paper gives a tight upper bound on the spectral radius of the signless Laplacian of graphs of g...
Let qmin(G) stand for the smallest eigenvalue of the signless Laplacian of a graph G of order n. Thi...
AbstractIn this paper, we first give an upper bound for the largest signless Laplacian eigenvalue of...
[[abstract]]By the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where...
AbstractLet G be a simple connected graph with n vertices and m edges. Denote the degree of vertex v...
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. I...
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...
AbstractBy the signless Laplacian of a (simple) graph G we mean the matrix Q(G)=D(G)+A(G), where A(G...
AbstractLet G=(V,E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and ...
Abstract. Let G be a graph of order n and let q(G) be the largest eigenvalue of the signless Laplaci...