✦ LIBER ✦

Non-uniform random spanning trees on weighted graphs

✍ Scribed by M. Mosbah; N. Saheb

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 547 KB
Volume: 218
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00325-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the spanning trees of weighted graphs

✍ Ernst W. Mayr; C. Greg Plaxton 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 874 KB

Edge disjoint spanning trees in random g

Edge disjoint spanning trees in random graphs

✍ A. M. Frieze; T. Łuczak 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

On finding most uniform spanning trees

✍ Zvi Galil; Baruch Schieber 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Heavy cycles and spanning trees with few

Heavy cycles and spanning trees with few leaves in weighted graphs

✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.

Generating the maximum spanning trees of

Generating the maximum spanning trees of a weighted graph

✍ Fǎnicǎ Gavril 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w