Geodesic
Circular distance in directed graphs
Mathematica Bohemica, Tome 122 (1997) no. 2, pp. 113-119

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

MR Zbl
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.
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.
DOI : 10.21136/MB.1997.125917
Classification : 05C12, 05C20, 05C38
Keywords: strongly connected digraph; circular distance; directed cactus 
Zelinka, Bohdan. Circular distance in directed graphs. Mathematica Bohemica, Tome 122 (1997) no. 2, pp. 113-119. doi: 10.21136/MB.1997.125917
@article{10_21136_MB_1997_125917,
     author = {Zelinka, Bohdan},
     title = {Circular distance in directed graphs},
     journal = {Mathematica Bohemica},
     pages = {113--119},
     year = {1997},
     volume = {122},
     number = {2},
     doi = {10.21136/MB.1997.125917},
     mrnumber = {1460940},
     zbl = {0889.05045},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.125917/}
}
TY  - JOUR
AU  - Zelinka, Bohdan
TI  - Circular distance in directed graphs
JO  - Mathematica Bohemica
PY  - 1997
SP  - 113
EP  - 119
VL  - 122
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.125917/
DO  - 10.21136/MB.1997.125917
LA  - en
ID  - 10_21136_MB_1997_125917
ER  - 
%0 Journal Article
%A Zelinka, Bohdan
%T Circular distance in directed graphs
%J Mathematica Bohemica
%D 1997
%P 113-119
%V 122
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/MB.1997.125917/
%R 10.21136/MB.1997.125917
%G en
%F 10_21136_MB_1997_125917

[1] B. Zelinka: Centers of directed cacti. Časopis pěst. mat. 114, (1989), 225-229. | MR | Zbl

Cité par Sources :