✦ LIBER ✦

Unranking and ranking spanning trees of a graph

✍ Scribed by Charles J Colbourn; Robert P.J Day; Louis D Nel

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 845 KB
Volume: 10
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(89)90016-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ranking and unranking of B-trees

✍ U.I Gupta; D.T Lee; C.K Wong 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 520 KB

Spanning trees fixed by automorphisms of

Spanning trees fixed by automorphisms of a graph

✍ M. Kano; A. Sakamoto 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 223 KB

Let G be a finite graph and A be a subgroup of Aut(G). We give a necessary and sufficient condition for the graph G to have an A-invariant spanning tree.

Spanning trees of dual graphs

✍ Norman Biggs 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 210 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

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

On the number of spanning trees in a mol

On the number of spanning trees in a molecular graph

✍ R.B. Mallion 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 444 KB

A rccenl theorem due to W'aller is applied to the mokculnr gmph of a typical conjugtcd system (naphthalene) in order to demonstrate the enumeration of spanning trees, on each of which a "ring current" calculation may be based.