On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph
S. Pirzada, Saleem Khan

TL;DR
This paper establishes optimal upper bounds for Zagreb index, signless Laplacian eigenvalues, and energy of a graph, providing characterizations of extremal graphs and relations to various graph parameters.
Contribution
It introduces new upper bounds for the Zagreb index and signless Laplacian spectral quantities, with characterizations of extremal cases and applications to graph energy.
Findings
Derived best possible upper bounds for the Zagreb index.
Established bounds for the sum of largest and smallest signless Laplacian eigenvalues.
Provided bounds for the signless Laplacian energy and characterized extremal graphs.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Synthesis and Properties of Aromatic Compounds · Molecular spectroscopy and chirality
