Bounds on the general eccentric distance sum of graphs

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.