Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949553 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
For a simple graph G with n-vertices, m edges and having signless Laplacian eigenvalues q1,q2,â¦,qn, the signless Laplacian energy QE(G) of the graph G is defined as QE(G)=âi=1nâ£qiâd¯â£, where d¯=2mn is the average degree of G. In this paper, we obtain the lower and upper bounds for the signless Laplacian energy QE(G) in terms of clique number Ï, maximum degree Î, number of vertices n, first Zagreb index M1(G) and number of edges m. As an application, we obtain the bounds for the energy of line graph â(G) of a graph G in terms of various graph parameters. We also obtain a relation between the signless Laplacian energy QE(G) and the incidence energy IE(G).
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hilal A. Ganie, S. Pirzada,