Enumeration of Hamiltonian Cycles in 6-cube
نویسندگان
چکیده
Finding the number 2H6 of directed Hamiltonian cycles in 6-cube is problem 43 in Section 7.2.1.1 of Knuth’s The Art of Computer Programming ([Kn10]); various proposed estimates are surveyed below. We computed exact value: H6=14, 754, 666, 508, 334, 433, 250, 560=6!*2 4*217, 199*1, 085, 989*5, 429, 923. Also the number Aut6 of those cycles up to automorphisms of 6-cube was computed as 147,365,405,634,413,085
منابع مشابه
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representation, and presented it for dimension 4. We classify cycles in two further dimensions using a reduction to propositional SAT. Our proposed algorithm starts with an over-approximation of the set of equivalence classes, whi...
متن کاملHamiltonian Decomposition of the Hypercube
We consider the problem of Hamiltonian decomposition on the hypercube. It is known that there exist bn=2c edge-disjoint Hamiltonian cycles on a binary n-cube. However, there are still no simple algorithms to construct such cycles. We present some promising results that may lead to a very simple method to obtain the Hamiltonian decomposition. The binary n-cube is equivalent to the Cartesian prod...
متن کاملGraph Algorithms for Constructing and Enumerating Cycles and Related Structures
Aalto University, P.O. Box 11000, FI-00076 Aalto www.aalto.fi Author Ville Pettersson Name of the doctoral dissertation Graph Algorithms for Constructing and Enumerating Cycles and Related Structures Publisher School of Electrical Engineering Unit Department of Communications and Networking Series Aalto University publication series DOCTORAL DISSERTATIONS 127/2015 Field of research Information ...
متن کاملA systematic approach for finding Hamiltonian cycles with a prescribed edge in crossed cubes
The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition f...
متن کاملHamiltonian Cycle within Extended OTIS-Cube Topology
This paper introduces a complete description of constructing a Hamiltonian cycle in the Extended OTIS-n-Cube topology. The recently proposed network has many good topological features such as regular degree, semantic structure, low diameter, and ability to embed graphs and cycles. Constructing a Hamiltonian cycle is an important feature for any topology due to the importance of broadcast messag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1003.4391 شماره
صفحات -
تاریخ انتشار 2010