### 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 language | English (US) |
---|---|

Pages (from-to) | 177-179 |

Number of pages | 3 |

Journal | Environment & Planning B |

Volume | 9 |

Issue number | 2 |

State | Published - Jan 1 1982 |

Externally published | Yes |

### 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

Doyle, J. K., & Graver, J. E. (1982). A summary of results on mean distance in shapes ( graph).

*Environment & Planning B*,*9*(2), 177-179.