| Title:
|
Circular distance in directed graphs (English) |
| Author:
|
Zelinka, Bohdan |
| Language:
|
English |
| Journal:
|
Mathematica Bohemica |
| ISSN:
|
0862-7959 (print) |
| ISSN:
|
2464-7136 (online) |
| Volume:
|
122 |
| Issue:
|
2 |
| Year:
|
1997 |
| Pages:
|
113-119 |
| Summary lang:
|
English |
| . |
| Category:
|
math |
| . |
| 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. (English) |
| Keyword:
|
strongly connected digraph |
| Keyword:
|
circular distance |
| Keyword:
|
directed cactus |
| MSC:
|
05C12 |
| MSC:
|
05C20 |
| MSC:
|
05C38 |
| idZBL:
|
Zbl 0889.05045 |
| idMR:
|
MR1460940 |
| DOI:
|
10.21136/MB.1997.125917 |
| . |
| Date available:
|
2009-09-24T21:23:37Z |
| Last updated:
|
2020-07-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/125917 |
| . |
| Reference:
|
[1] B. Zelinka: Centers of directed cacti.Časopis pěst. mat. 114, (1989), 225-229. Zbl 0681.05034, MR 1016631 |
| . |
