✦ LIBER ✦

Mean distance in a graph

✍ Scribed by J.K. Doyle; J.E. Graver

Book ID: 107748254
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 293 KB
Volume: 17
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90144-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Eigenvalues, diameter, and mean distance

Eigenvalues, diameter, and mean distance in graphs

✍ Bojan Mohar 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 608 KB

On the Mean Distance in Scale Free Graph

On the Mean Distance in Scale Free Graphs

✍ G. Hooghiemstra; P. Mieghem 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 468 KB

On mean distance in certain classes of g

On mean distance in certain classes of graphs

✍ George R. T. Hendry 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB 👁 1 views

Existence of graphs with prescribed mean

Existence of graphs with prescribed mean distance

✍ G. R. T. Hendry 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

Mean distance in a tree

✍ Peter Winkler 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 348 KB

Distinct distance sets in a graph

✍ Richard A. Gibbs; Peter J. Slater 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 987 KB

The problem of labelling the complete graph K,, as near to graceful as possible is equivalent to the 'Golomb ruler problem' of finding as short a ruler as possible with n integer marks such that the distances between pairs of marks are all distinct. We generalize this to an association between label