𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting spanning trees in a small-world Farey graph

✍ Scribed by Zhongzhi Zhang; Bin Wu; Yuan Lin

Book ID
113849428
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
244 KB
Volume
391
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On spanning 2-trees in a graph
On spanning 2-trees in a graph
✍ Leizhen Cai πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 963 KB

A k-tree is either a complete graph on k vertices or a graph T that contains a vertex whose neighbourhood in T induces a complete graph on k vertices and whose removal results in a k-tree. A subgraph of a graph is a spanning k-tree if it is a k-tree and contains every vertex of the graph. This pape

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

Counting spanning trees in the graphs of
Counting spanning trees in the graphs of Kleitman and Golden and a generalization
✍ R. Vohra; L. Washington πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 302 KB

A new calculation is given for the number of spanning trees in a family of labellec; graphs considered by Kleitman and Golden, and for a more general class of such graphs.