Distance in digraphs
The authors recall known results concerning distance in a graph and standard distance in a digraph. They define two new distances in strong digraphs: \(d_{\max} (u,v)= \max (d(u,v),\;d(v,u))\) and \(d_{\text{sum}} (u,v)= d(u,v) +d(v,u)\). Several results and problems concerning these distances and parameters such as center, median, and periphery are described.
scientific article; zbMATH DE number 1164075
scientific article