𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Low-degree minimum spanning trees

✍ Scribed by G. Robins; J. S. Salowe

Book ID
110559141
Publisher
Springer
Year
1995
Tongue
English
Weight
779 KB
Volume
14
Category
Article
ISSN
0179-5376

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

Spanning trees with minimum weighted deg
Spanning trees with minimum weighted degrees
✍ Mohammad Ghodsi; Hamid Mahini; Kian Mirjalali; Shayan Oveis Gharan; Amin S. Saye πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 122 KB
Degree Bounded Spanning Trees
Degree Bounded Spanning Trees
✍ Jun Fujisawa; Hajime Matsumura; Tomoki Yamashita πŸ“‚ Article πŸ“… 2010 πŸ› Springer Japan 🌐 English βš– 659 KB