Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6423685 | Electronic Notes in Discrete Mathematics | 2016 | 6 Pages |
Abstract
Let G be a graph with n vertices and e(G) edges. The signless Laplacian of G, denoted by Q(G), is given by Q(G)=D(G)+A(G), where D(G) and A(G) are the diagonal matrix of its vertex degree and A(G) is the adjacency matrix. Let q1(G),â¦,qn(G) be the eigenvalues of Q(G) in non-increasing order and let Tk(G)=âi=1kqi(G) be the sum of the k largest signless Laplacian eigenvalues of G. In this paper, we obtain an upper bound to Tk(H), when H is the P3-join graph isomorphic to P3[(nâkâ1)K1,Kkâ1,K2] for 3â¤kâ¤nâ2. Also, we conjecture that Tk(G) is bounded above by Tk(H) for any G with n vertices.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bruno Amaro, Leonardo de Lima, Carla Oliveira, Carlile Lavor, Nair Abreu,