On the General Eccentric Distance Sum of Graphs and Trees

Yetneberk Kuma Feyissa, Muhammad Imran, Tomáš Vetrík, Natea Hunde

Research output: Contribution to journalArticlepeer-review

Abstract

We obtain some sharp bounds on the general eccentric distance sum for general graphs, bipartite graphs and trees with given order and diameter 3, graphs with given order and domination number 2, and for the join of two graphs with given order and number of vertices having maximum possible degree.

Original languageEnglish
Pages (from-to)239-252
Number of pages14
JournalIranian Journal of Mathematical Chemistry
Volume13
Issue number4
DOIs
Publication statusPublished - Dec 2022

Keywords

  • Bipartite graph
  • Diameter
  • Join
  • Topological index

ASJC Scopus subject areas

  • General Chemistry
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On the General Eccentric Distance Sum of Graphs and Trees'. Together they form a unique fingerprint.

Cite this