𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Spanning Regular Caterpillars in Hypercubes

✍ Scribed by R. Caha; V. Koubek

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
423 KB
Volume
18
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Spanning caterpillars of a hypercube
Spanning caterpillars of a hypercube
✍ Dvo?οΏ½k, TomοΏ½?k; Havel, Ivan; Laborde, Jean-Marie; Mollard, Michel πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 184 KB

Spanning trees of the hypercube Q n have been recently studied by several authors. In this paper, we construct spanning trees of Q n which are caterpillars and establish quantitative bounds for a caterpillar to span Q n . As a corollary, we disprove a conjecture of Harary and Lewinter on the length

Leafy spanning trees in hypercubes
Leafy spanning trees in hypercubes
✍ W. Duckworth; P.E. Dunne; A.M. Gibbons; M. Zito πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 214 KB

We prove that the d-dimensional hypercube, Qd, with n ----2 d vertices, contains a spanning tree with at least 1 log 2 n o n -t-2 leaves. This improves upon the bound implied by a more general result on spanning trees in graphs with minimum degree 5, which gives (1 -O(loglogn)/log 2 n)n as a lower b

Counting spanning trees in directed regu
Counting spanning trees in directed regular multigraphs
✍ Jacek M. Wojciechowski; Michael Fellows πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 484 KB

The problem of counting spunning trees in regular multigraphs is considered. The emphasis is on the case of directed trees. It is shown that the numbers qf spanning intrees and out-trees with respect to any point of' a regular multigraph are the same. A general .formulafor counting directed spunning