A Summary of Results on Mean Distance in Shapes

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

Environment and Planning B, 1982, vol. 9, issue 2, 177-179

Abstract: The average or mean of the distances between pairs of vertices in a connected graph is a natural measure of the compactness of that graph. Using graphs to represent shapes, or corridor arrangements, we arrive, through a limiting process, at a concept for mean distance in shapes. This paper gives the mean distance for eight specific shapes and six infinite families of shapes.

Date: 1982
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b090177 (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:9:y:1982:i:2:p:177-179

DOI: 10.1068/b090177

Access Statistics for this article

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