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

J. K. Doyle; J. E. Graver

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

Research output: Contribution to journal › Article › peer-review

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 - 1982
Externally published	Yes

ASJC Scopus subject areas

General Environmental Science
General Earth and Planetary Sciences

Cite this

@article{0f63de66ae2f49e4bdf7bf19c60d8114,

title = "A summary of results on mean distance in shapes ( graph).",

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",

author = "Doyle, {J. K.} and Graver, {J. E.}",

year = "1982",

language = "English (US)",

volume = "9",

pages = "177--179",

journal = "Environment & Planning B",

issn = "0308-2164",

publisher = "Pion Ltd.",

number = "2",

}

TY - JOUR

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

AU - Doyle, J. K.

AU - Graver, J. E.

PY - 1982

Y1 - 1982

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

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

UR - http://www.scopus.com/inward/record.url?scp=0020372658&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020372658&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0020372658

SN - 0308-2164

VL - 9

SP - 177

EP - 179

JO - Environment & Planning B

JF - Environment & Planning B

IS - 2

ER -

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

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this