๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Spanning subgraphs of a hypercube II: Double starlike trees

โœ Scribed by Frank Harary; Martin Lewinter

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
139 KB
Volume
11
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The starlike trees which span a hypercub
The starlike trees which span a hypercube
โœ Frank Harary; Martin Lewinter ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 222 KB

A connected bipartite graph is called equitable if it has the same number of nodes in each of its two colors. A starlike tree with b branches is a subdivision of the star K~. b with b ~> 3. We prove that a starlike tree T with b branches, where 3 ~< b ~< n, having 2 n nodes spans the hypercube Qn if

A spanning tree of the 2m-dimensional hy
A spanning tree of the 2m-dimensional hypercube with maximum number of degree-preserving vertices
โœ Sul-young Choi; Puhua Guan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB

For an n-dimensional hypercube Q., the maximum number of degree-preserving vertices in a spanning tree is 2"jn if n = 2" for an integer M. (If n # 2", then the maximum number of degree-preserving vertices in a spanning tree is less than 2"/n.) We also construct a spanning tree of Qzm with maximum nu

Counting the number of spanning trees in
Counting the number of spanning trees in a class of double fixed-step loop networks
โœ Talip Atajan; Naohisa Otsuka; Xuerong Yong ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 495 KB

A double fixed-step loop network, C p,q n , is a digraph on n vertices 0, 1, 2, . . . , n -1 and for each vertex i (0 < i โ‰ค n-1), there are exactly two arcs going from vertex i to vertices i+p, i + q (mod n). Let p < q < n be positive integers such that (qp) ฤŽ n and (qp)|(k 0 np) or (qp)|n (where k