No Detail Found!

Bounds on the general eccentric distance sum of graphs

Author(s)
Yetneberk Kuma Feyissa Department of Applied Mathematics, School of Applied Natural Science, Adama Science and Technology University,Adama,Ethiopia
Tomas Vetrik Department of Mathematics and Applied Mathematics, University of the Free State,Bloemfontein,South Africa
Abstract
Some sharp bounds on the general eccentric distance sum are presented for (i) graphs with given order and chromatic number, (ii) trees with given bipartition, and (iii) bipartite graphs with given order and matching number. Bounds for bipartite graphs hold also if the matching number is replaced by the independence number, vertex cover number or edge cover number.
Publication Details
Page(s) 99-106
Published Journal: Discrete Mathematics Letters, Volume: 10, Issue: 0, Year: 2022

Request the full text from PASTIC

Keywords
bipartite graph, Wiener index, general eccentric distance sum, distance-based index
0

Citations

0

Downloads

44

Views