About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Zelinka, Bohdan
Circular distance in directed graphs. (English). Mathematica Bohemica, vol. 122 (1997), issue 2, pp. 113-119
MSC: 05C12, 05C20, 05C38 | MR 1460940 | Zbl 0889.05045 | DOI: 10.21136/MB.1997.125917
Keywords:
strongly connected digraph; circular distance; directed cactus
Summary:
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.
References:
[1] B. Zelinka: Centers of directed cacti. Časopis pěst. mat. 114, (1989), 225-229. MR 1016631 | Zbl 0681.05034
Partner of
EuDML logo