✦ LIBER ✦

Minimal ratio spanning trees

✍ Scribed by R. Chandrasekaran

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 323 KB
Volume: 7
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230070405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Scaling limits for minimal and random sp

Scaling limits for minimal and random spanning trees in two dimensions

✍ Michael Aizenman; Almut Burchard; Charles M. Newman; David B. Wilson 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB

A general formulation is presented for continuum scaling limits of stochastic spanning trees. A spanning tree is expressed in this limit through a consistent collection of subtrees, which includes a tree for every finite set of endpoints in ‫ޒ‬ d . Tightness of the distribution, as ␦ ª 0, is establi

Balancing two spanning trees

✍ Matthias Kriesell 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

Random minimal spanning tree and percola

Random minimal spanning tree and percolation on the N-cube

✍ Mathew D. Penrose 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB 👁 1 views

The N-cube is a graph with 2 N vertices and N 2 Ny1 edges. Suppose indepen- dent uniform random edge weights are assigned and let T be the spanning tree of minimal Ž . y 1 N ϱ y3 total weight. Then the weight of T is asymptotic to N 2 Ý i as N ª ϱ. Asymp-is1 totics are also given for the local stru

Spanning trees with many leaves

✍ Guoli Ding; Thor Johnson; Paul Seymour 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB

## Abstract We show that if __G__ is a simple connected graph with and $|V(G)| \,\neq\,t+2$, then __G__ has a spanning tree with > __t__ leaves, and this is best possible. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 189–197, 2001

Counting Minimum Weight Spanning Trees

✍ Andrei Z. Broder; Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our Ž Ž .. Ž . algorithm r