On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
arXiv:2205.03580
Abstract
Let be a simple graph with order and size . The quantity is called the first Zagreb index of , where is the degree of vertex , for all . The signless Laplacian matrix of a graph is , where and denote, respectively, the adjacency and the diagonal matrix of the vertex degrees of . Let be the signless Laplacian eigenvalues of . The largest signless Laplacian eigenvalue is called the signless Laplacian spectral radius or -index of and is denoted by . Let and , where , respectively denote the sum of largest and smallest signless Laplacian eigenvalues of . The signless Laplacian energy of is defined as , where is the average vertex degree of . In this article, we obtain upper bounds for the first Zagreb index and show that each bound is best possible. Using these bounds, we obtain several upper bounds for the graph invariant and characterize the extremal cases. As a consequence, we find upper bounds for the -index and lower bounds for the graph invariant in terms of various graph parameters and determine the extremal cases. As an application, we obtain upper bounds for the signless Laplacian energy of a graph and characterize the extremal cases.
13