Sharp Bounds for Generalized Zagreb Indices of Graphs

TL;DR

This paper derives formulas and bounds for generalized Zagreb indices and coindices in graphs, including special cases for triangle and quadrangle free graphs, and applies these to predict properties of chemical compounds.

Contribution

It introduces new bounds and formulas for generalized Zagreb indices and leap indices, including for specific graph classes, and compares their effectiveness in chemical property prediction.

Findings

Established sharp bounds for generalized Zagreb indices.

Derived formulas for triangle and quadrangle free graphs.

Compared indices for predicting chemical properties.

Abstract

In the last forty years, many scientists used graph theory to develop mathematical models for analyzing structures and properties of various chemical compounds. In this paper, we will establish formulas and bounds for generalized first Zagreb Index and coindex, which are based on degrees of vertices. In addition, for triangle and quadrangle free graphs, we will establish formulas and bounds for generalized first leap Zagreb Index and coindex, which are based on 2-distance degrees of vertices. Additionally, we will establish sharp bounds of generalized first Zagreb index and the leap index for various types of graphs and provide examples for which the sharp bounds are attained. In addition, we will find regression models and compare the first Zagreb index and the first leap Zagreb index for predicting some physicochemical properties of certain chemical compounds, benzenoid hydrocarbons.