On the first general Zagreb eccentricity index

Muhammad Kamran Jamil, Muhammad Imran, Aisha Javed, Roslan Hasni

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


In a graph G, the distance between two vertices is the length of the shortest path between them. The maximum distance between a vertex to any other vertex is considered as the eccentricity of the vertex. In this paper, we introduce the first general Zagreb eccentricity index and found upper and lower bounds on this index in terms of order, size and diameter. Moreover, we characterize the extremal graphs in the class of trees, trees with pendant vertices and bipartite graphs. Results on some famous topological indices can be presented as the corollaries of our main results.

Original languageEnglish
Pages (from-to)532-542
Number of pages11
JournalAIMS Mathematics
Issue number1
Publication statusPublished - 2021


  • Eccentricity of vertices
  • Extremal graphs
  • First general Zagreb eccentricity index

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'On the first general Zagreb eccentricity index'. Together they form a unique fingerprint.

Cite this