On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
Abstract
Let G be a simple graph with order n and size m. The quantity M1(G)=Σi=1nd2vi is called the first Zagreb index of G, where dvi is the degree of vertex vi, for all i=1,2,…,n. The signless Laplacian matrix of a graph G is Q(G)=D(G)+A(G), where A(G) and D(G) denote, respectively, the adjacency and the diagonal matrix of the vertex degrees of G. Let q1≥ q2≥ …≥ qn≥ 0 be the signless Laplacian eigenvalues of G. The largest signless Laplacian eigenvalue q1 is called the signless Laplacian spectral radius or Q-index of G and is denoted by q(G). Let S+k(G)=Σi=1kqi and Lk(G)=Σi=0k-1qn-i, where 1≤ k≤ n, respectively denote the sum of k largest and smallest signless Laplacian eigenvalues of G. The signless Laplacian energy of G is defined as QE(G)=Σi=1n|qi-d|, where d=2mn is the average vertex degree of G. In this article, we obtain upper bounds for the first Zagreb index M1(G) and show that each bound is best possible. Using these bounds, we obtain several upper bounds for the graph invariant S+k(G) and characterize the extremal cases. As a consequence, we find upper bounds for the Q-index and lower bounds for the graph invariant Lk(G) 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.