General Multiplicative Zagreb Indices of Graphs With Bridges

Multiplicative Zagreb indices have been studied due to their extensive applications. They play a substantial role in chemistry, pharmaceutical sciences, materials science and engineering, because we can correlate them with numerous physico-chemical properties of molecules. We use graph theory to characterize these chemical structures. The vertices of graphs represent the atoms of a compound and edges of graphs represent the chemical bonds. We present upper and lower bounds on the general multiplicative Zagreb indices for graphs with given number of vertices and cut-edges called bridges. We give all the extremal graphs, which implies that our bounds are best possible.