Year: 2022
Type: article
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.
Source: Discrete Mathematics Letters
Authors: Yetneberk Kuma Feyissa, Tomáš Vetrík
Language: English
Subfield: Geometry and Topology
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Award: G1065383303
OpenAlex ID: W4293731900