Directed graphs and its Boundary Vertices

Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shallet T. J +1

Suppose that $D=(V,E)$ is a strongly connected digraph. Let $u,v\in V(D)$. The maximum distance $md(u,v)$ is defined as $md(u,v)$=max\{$\overrightarrow{d}(u,v), \overrightarrow{d}…