Let $ G=(V, E) $ be a simple graph with $ n=| V| $ vertices and $ m=| E| $ edges. The first
and second Zagreb indices are among the oldest and the most famous topological indices …

It was conjectured that for each simple graph G=(V, E) with n=| V (G)| vertices and m=| E (G)|
edges, it holds M2 (G)/m≥ M1 (G)/n, where M1 and M2 are the first and second Zagreb …

Gutman et al. defined the Zagreb indices for the first time more than 40 years ago and up to
now many versions of these topological indices were defined. In this paper we define a type …

We derive sharp lower bounds for the first and the second Zagreb indices ($ M_1 $ and $
M_2 $ respectively) for trees and chemical trees with the given number of pendent vertices …

Let ${\mathcal G} _n $ be the set of class of graphs of order $ n $. The first Zagreb index $
M_1 (G) $ is equal to the sum of squares of the degrees of the vertices, and the second …

For a (molecular) graph G, the first and the second entire Zagreb indices are defined by the
formulas M 1 ε G=∑ x∈ VG∪ EG dx 2 and M 2 ε G=∑ x is either adjacent or incident to …

The first Zagreb index M1 is equal to the sum of the squares of the degrees of the vertices,
and the second Zagreb index M2 is equal to the sum of the products of the degrees of pairs …

Let∏(G) be multiplicative Zagreb index of a graph G. A connected graph is a cactus graph if
and only if any two of its cycles have at most one vertex in common, which is a …

Zagreb Indices: Bounds and Extremal Graphs Page 1 MCM 19 I. Gutman, B. Furtula, KC Das,
E. Milovanovic, I. Milovanovic (Eds.), Bounds in Chemical Graph Theory – Basics, Univ …

Zagreb indices belong to better known and better researched topological indices. We
investigate here their ability to discriminate among BENZENOID GRAPH s and arrive at …