Circular distance in directed graphs

Zelinka, Bohdan. "Circular distance in directed graphs." Mathematica Bohemica 122.2 (1997): 113-119. <http://eudml.org/doc/248116>.

@article{Zelinka1997,
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.},
author = {Zelinka, Bohdan},
journal = {Mathematica Bohemica},
keywords = {strongly connected digraph; circular distance; directed cactus; strongly connected digraph; circular distance; directed cactus},
language = {eng},
number = {2},
pages = {113-119},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Circular distance in directed graphs},
url = {http://eudml.org/doc/248116},
volume = {122},
year = {1997},
}

TY - JOUR
AU - Zelinka, Bohdan
TI - Circular distance in directed graphs
JO - Mathematica Bohemica
PY - 1997
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 122
IS - 2
SP - 113
EP - 119
AB - 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.
LA - eng
KW - strongly connected digraph; circular distance; directed cactus; strongly connected digraph; circular distance; directed cactus
UR - http://eudml.org/doc/248116
ER -