In this paper we study the mean of the distances in a directed graph and compare the results obtained with the corresponding results for undirected graphs. We derive a formula which enables the computation of best possible upper and lower bounds for the mean of the distances in a directed graph. Finally we present a table of values of the mean distance for small graphs and directed graphs.
Get full access to this article
View all access options for this article.
References
1.
DoyleJ KGraverJ E, 1977“Mean distance in a graph”Discrete Mathematics17(2) 147–154
2.
EntringerR CJacksonD ESnyderD A, 1976“Distance in graphs”Czechoslovak Mathematical Journal26(101) 283–296
3.
HararyF, 1969Graph Theory (Addison-Wesley, Reading, Mass)
4.
MarchLSteadmanP, 1971The Geometry of Environment (Royal Institute of British Architects, London)
5.
TaborO P, 1976“Analysing route patterns” in The Architecture of Form Ed. MarchL (Cambridge University Press, London) pp 352–378
