Bohdan Zelinka, Technicka univerzita Liberec, katedra diskrétni matematiky a statistiky, Voronezska 13, 461 17 Liberec 1, Czech Republic
Abstract: Circular distance $d^\circ(x,y)$ between two vertices $x$, $y$ of a strongly connected directed graph $G$ is the sum $d(x,y)+d(y,x)$, where $d$ is the usual distance in digraphs. Its basic properties are studied.
Keywords: strongly connected digraph, circular distance, directed cactus
Classification (MSC2000): 05C38, 05C20
Full text of the article: