Mean Distance in a Directed Graph

J K Doyle and J E Graver
Additional contact information
J K Doyle: Department of Mathematics, Emory University, Atlanta, Georgia 30322, USA
J E Graver: Department of Mathematics, Syracuse University, Syracuse, New York 13210, USA

Environment and Planning B, 1978, vol. 5, issue 1, 19-29

Abstract: 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.

Date: 1978
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b050019 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:5:y:1978:i:1:p:19-29

DOI: 10.1068/b050019

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().