𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Most and least uniform spanning trees

✍ Scribed by Paolo M. Camerini; Francesco Maffioli; Silvano Martello; Paolo Toth

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
708 KB
Volume
15
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On finding most uniform spanning trees
On finding most uniform spanning trees
✍ Zvi Galil; Baruch Schieber πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 243 KB
Uniform and minimal essential spanning f
Uniform and minimal essential spanning forests on trees
✍ Olle HΓ€ggstrΓΆm πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,

Spanning trees with leaf distance at lea
Spanning trees with leaf distance at least four
✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 175 KB

## Abstract For a graph __G__, we denote by __i__(__G__) the number of isolated vertices of __G__. We prove that for a connected graph __G__ of order at least five, if __i__(__G__–__S__) < |__S__| for all βˆ…οΈ β‰  __S__ βŠ† __V__(__G__), then __G__ has a spanning tree __T__ such that the distance in __T_