New bounds on the hyper-Zagreb index for the simple connected graphs

Suresh Elumalai, Toufik Mansour, Mohammad Ali Rostami

Research output: Contribution to journalArticlepeer-review


The hyper-Zagreb index of a simple connected graph G is defined by. 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 (Δ), and minimum vertex degree (δ), first Zagreb index M1(G), second Zagreb index M2(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.

Original languageEnglish
Pages (from-to)166-177
Number of pages12
JournalElectronic Journal of Graph Theory and Applications
Issue number1
StatePublished - 2018

Bibliographical note

Publisher Copyright:
© 2018 Indonesian Combinatorics Society.


  • Forgotten index
  • Hyper-zagreb index
  • Zagreb indices

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'New bounds on the hyper-Zagreb index for the simple connected graphs'. Together they form a unique fingerprint.

Cite this