Combinatorial Gray Code for Generating Tree of Permutation with Two Cycles

Abstract

Combinatorial Gray Code is a listing of all considered combinatorial objects so that every two successive objects differ in some pre-specified way. This paper concerns of a combinatorial class namely permutations with two cycles. In our research these permutations have been developed using generating tree. The generating tree is then coded, and listing the node of this tree will be shoed as a Gray code. In this paper we proposed a new combinatorial Gray code. We give the construction of the Gray code for this coded generating tree of generating permutation with two cycles. The Gray code will be measured by its Hamming distance in order to show that it is a Gray code.

Cite this paper

@inproceedings{Puspitodjati2014CombinatorialGC, title={Combinatorial Gray Code for Generating Tree of Permutation with Two Cycles}, author={Sulistyo Puspitodjati and Henny Widowati and Asep Juarna and Djati Kerami}, year={2014} }