On the General Eccentric Distance Sum of Graphs and Trees

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

doi:10.22052/IJMC.2022.246189.1617

On the General Eccentric Distance Sum of Graphs and Trees

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

Department of Mathematical Sciences

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	239-252
Number of pages	14
Journal	Iranian Journal of Mathematical Chemistry
Volume	13
Issue number	4
DOIs	https://doi.org/10.22052/IJMC.2022.246189.1617
Publication status	Published - Dec 2022

Keywords

Bipartite graph
Diameter
Join
Topological index

ASJC Scopus subject areas

Chemistry(all)
Applied Mathematics

Access to Document

10.22052/IJMC.2022.246189.1617

Cite this

@article{7ef0039808584e6fb5e6487f36cc64c6,

title = "On the General Eccentric Distance Sum of Graphs and Trees",

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.",

keywords = "Bipartite graph, Diameter, Join, Topological index",

author = "Feyissa, {Yetneberk Kuma} and Muhammad Imran and Tom{\'a}{\v s} Vetr{\'i}k and Natea Hunde",

year = "2022",

month = dec,

doi = "10.22052/IJMC.2022.246189.1617",

language = "English",

volume = "13",

pages = "239--252",

journal = "Iranian Journal of Mathematical Chemistry",

issn = "2228-6489",

publisher = "University of Kashan",

number = "4",

}

TY - JOUR

T1 - On the General Eccentric Distance Sum of Graphs and Trees

AU - Feyissa, Yetneberk Kuma

AU - Imran, Muhammad

AU - Vetrík, Tomáš

AU - Hunde, Natea

PY - 2022/12

Y1 - 2022/12

N2 - 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.

AB - 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.

KW - Bipartite graph

KW - Diameter

KW - Join

KW - Topological index

UR - http://www.scopus.com/inward/record.url?scp=85147780654&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85147780654&partnerID=8YFLogxK

U2 - 10.22052/IJMC.2022.246189.1617

DO - 10.22052/IJMC.2022.246189.1617

M3 - Article

AN - SCOPUS:85147780654

SN - 2228-6489

VL - 13

SP - 239

EP - 252

JO - Iranian Journal of Mathematical Chemistry

JF - Iranian Journal of Mathematical Chemistry

IS - 4

ER -

On the General Eccentric Distance Sum of Graphs and Trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this