Eccentricity function in distance-hereditary graphs

Feodor F. Dragan, Heather M. Guarnera

A graph $G=(V,E)$ is distance hereditary if every induced path of $G$ is a shortest path. In this paper, we show that the eccentricity function $e(v)=\max \{d(v,u):u\in V\}$ in any…