Circular distance in directed graphs
Bohdan Zelinka (1997)
Mathematica Bohemica
Similarity:
Circular distance between two vertices , of a strongly connected directed graph is the sum , where is the usual distance in digraphs. Its basic properties are studied.