Remarks on distance based topological indices for ℓ-apex trees

Martin Knor, Muhammad Imran, Muhammad Kamran Jamil, Riste Škrekovski

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A graph G is called an ℓ-apex tree if there exist a vertex subset A ⊂ V(G) with cardinality l such that G-A is a tree and there is no other subset of smaller cardinality with this property. In the paper, we investigate extremal values of several monotonic distance-based topological indices for this class of graphs, namely generalizedWiener index, and consequently for the Wiener index and the Harary index, and also for some newer indices as connective eccentricity index, generalized degree distance, and others. For the one extreme value we obtain that the extremal graph is a join of a tree and a clique. Regarding the other extreme value, which turns out to be a harder problem, we obtain results for ℓ = 1 and pose some open questions for higher ℓ. Symmetry has always played an important role in Graph Theory, in recent years, this role has increased significantly in several branches of this field, including topological indices of graphs.

Original languageEnglish
Article number802
Issue number5
Publication statusPublished - May 1 2020


  • Apex trees
  • Distances in apex trees
  • Extremal graphs
  • Generalized wiener index

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Chemistry (miscellaneous)
  • General Mathematics
  • Physics and Astronomy (miscellaneous)


Dive into the research topics of 'Remarks on distance based topological indices for ℓ-apex trees'. Together they form a unique fingerprint.

Cite this