A summary of results on mean distance in shapes ( graph).

J. K. Doyle, J. E. Graver

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

The 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, leads to a concept for mean distance in shapes. This paper gives the mean distance for eight specific shapes and six infinite families of shapes.-Authors

Original languageEnglish (US)
Pages (from-to)177-179
Number of pages3
JournalEnvironment & Planning B
Volume9
Issue number2
StatePublished - Jan 1 1982
Externally publishedYes

ASJC Scopus subject areas

  • Environmental Science(all)
  • Earth and Planetary Sciences(all)

Fingerprint Dive into the research topics of 'A summary of results on mean distance in shapes ( graph).'. Together they form a unique fingerprint.

  • Cite this