Mean distance in a directed graph
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.
When requesting a correction, please mention this item's handle: RePEc:pio:envirb:v:5:y:1978:i:1:p:19-29. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Neil Hammond)
If references are entirely missing, you can add them using this form.