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

On the equitablek*-laceability of hypercubes

โœ Scribed by Chung-Haw Chang; Chao-Ming Sun; Hua-Min Huang; Lih-Hsing Hsu

Publisher
Springer US
Year
2007
Tongue
English
Weight
441 KB
Volume
14
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hamiltonian-connectivity and strongly Ha
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
โœ Sun-Yuan Hsieh; Che-Nan Kuo ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 302 KB

In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded

On the Achromatic Number of Hypercubes
On the Achromatic Number of Hypercubes
โœ Yuval Roichman ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

The achromatic number of a finite graph G, (G), is the maximum number of independent sets into which the vertex set may be partitioned, so that between any two parts there is at least one edge. For an m-dimensional hypercube P m 2 we prove that there exist constants 0<c 1 <c 2 , independent of m, su

On a class of Hamiltonian laceable 3-reg
On a class of Hamiltonian laceable 3-regular graphs
โœ Brian Alspach; C.C. Chen; Kevin McAvaney ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB

Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt