Lower bounds on the entire Zagreb indices of trees (Q2188024)

Summary: For a (molecular) graph \(G\), the first and the second entire Zagreb indices are defined by the formulas \(M_1^\varepsilon\left( G\right)=\sum_{x \in V \left( G\right) \cup E \left( G\right)} d \left( x\right)^2\) and \(M_2^\varepsilon\left( G\right)= \sum_{x \text{ is either adjacent or incident to } y} d \left( x\right) d \left( y\right)\) in which \(d\left( x\right)\) represents the degree of a vertex or an edge \(x\). In the current manuscript, we establish some lower bounds on the first and the second entire Zagreb indices and determine the extremal trees which achieve these bounds.