๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Minimum Average Distance Spanning Tree of

โœ Scribed by Maurice Tchuente; Paulin Melatagia Yonta; Jean-Michel Nlong; Yves Denneulin

Publisher
Springer Netherlands
Year
2008
Tongue
English
Weight
492 KB
Volume
102
Category
Article
ISSN
0167-8019

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Average distance, minimum degree, and sp
Average distance, minimum degree, and spanning trees
โœ Dankelmann, Peter; Entringer, Roger ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 218 KB

The average distance ยต(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., ยต(G) = ( n 2 ) -1 {x,y}โŠ‚V (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph

The Capacitated Minimum Spanning Tree
The Capacitated Minimum Spanning Tree
โœ K. M. Chandy; Tachen Lo ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 386 KB

## Abstract The capacitated minimum spanning tree is an offspring of the minimum spanning tree and network flow problems. It has application in the design of multipoint linkages in elementary teleprocessing tree networks. Some theorems are used in conjunction with Little's branch and bound algorith