The Cartesian product of two hamiltonian graphs is always hamiltonian. For directed graphs, the analogous statement is false. We show that the Cartesian product C,,, x C, , of directed cycles is hamiltonian if and only if the greatest common divisor (g.c.d.) d of n, and n, is a t least two and there
Hamiltonian cycles in the cartesian product of a tree and a cycle
✍ Scribed by Vladimir Batagelj; Tomaž Pisanski
- Book ID
- 107748432
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 218 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We find necessary and sufficient conditions for the existence of a closed walk that traverses r vertices twice and the rest once in the Cayley digraph of 2, @ 2,. This is a generalization of the results known for r = 0 or 1. In 1978, Trotter and Erdos [3] gave a necessary and sufficient condition f
We show that the Cartesian product Z, x Z, of two directed cycles is hypo-Hamiltonian (Hamiltonian) if and only if there is a pair of relatively prime positive integers m and n with ma + nb = ab -1 (ma + nb = ab). The result for hypo-Hamiltonian is new; that for Hamiltonian is known. These are speci
## Abstract We show that the Cartesian product of two directed cycles __Z__~__a__~ X __Z__~__b__~ has __r__ disjointly embedded circuits __C__~1~, __C__~2~, ⃛, __C__~r~ with specified knot classes knot__(C~i~) = (m~i~, n~i~)__, for __i__ = 1, 2, ⃛, __r__, if and only if there exist relatively prime