we give sharp upper bounds on the zagreb indices and lower bounds on the zagreb coindices of chemical trees and characterize the case of equality for each of these topological invariants.

Inspired by the chemical applications of higher-order connectivity index (or Randic index), we consider here the higher-order first Zagreb index of a molecular graph. In this paper, we study the linear regression analysis of the second order first Zagreb index with the entropy and acentric factor of an octane isomers. The linear model, based on the second order first Zag...

Graph theory had wide applications in developing silico tools and it is widely used to calculate topological indices establish structural activity relations of chemicals/compounds. However, usage Zagreb with respect natural compounds activity/toxicity prediction needs more attention. Many available online are using atom bond connectivity index (ABC Index), first second indices. The the Hyper ve...

Let G be a graph. The first Zagreb M1(G) of graph G is defined as: M1(G) = uV(G) deg(u)2. In this paper, we prove that each even number except 4 and 8 is a first Zagreb index of a caterpillar. Also, we show that the fist Zagreb index cannot be an odd number. Moreover, we obtain the fist Zagreb index of some graph operations.

The first and second Hyper-Zagreb index of a connected graph $G$ is defined by $HM_{1}(G)=\sum_{uv \in E(G)}[d(u)+d(v)]^{2}$ $HM_{2}(G)=\sum_{uv E(G)}[d(u).d(v)]^{2}$. In this paper, the indices certain graphs are computed. Also bounds for determined. Further linear regression analysis degree based with boiling points benzenoid hydrocarbons carried out. model, on index, better than models corre...

As an inorganic chemical, magnesium iodide has a significant crystalline structure. It is complex and multi-functional substance that the potential to be used in wide range of medical advancements. Molecular graph theory, on other hand, provides sufficient cost-effective method investigating chemical structures networks. M-polynomial relatively new for studying networks molecular theory. displa...

in this paper we give sharp upper bounds on the zagreb indices and characterize all trees achieving equality in these bounds. also, we give lower bound on first zagreb coindex of trees.

let g be a graph. the first zagreb m1(g) of graph g is defined as: m1(g) = uv(g) deg(u)2. in this paper, we prove that each even number except 4 and 8 is a first zagreb index of a caterpillar. also, we show that the fist zagreb index cannot be an odd number. moreover, we obtain the fist zagreb index of some graph operations.