Abstract

The hyper-Zagreb index of a simple connected graph G is defined by ${\chi ^2}(G) = \sum_{uv \in E(G)} {{{\left( {d(u) + d(v)} \right)}^2}}$. In this paper, we establish, analyze and compare some new upper bounds on the Hyper-Zagreb index in terms of the number of vertices n, number of edges m, maximum vertex degree $\Delta$, and minimum vertex degree $\delta$, first Zagreb index M_1(G), second Zagreb index M_2(G), harmonic index H(G), and inverse edge degree IED(G). In addition, we give the identities on Hyper-Zagreb index and its coindex for the simple connected graphs.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.