Title of article
Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
Author/Authors
Inessa Levi، نويسنده , , Steve Seif ، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
19
From page
220
To page
238
Abstract
Let τ be a partition of the positive integer n. A partition of the set Xn={1,2,…,n} is said to be of type τ if the sizes of its classes form the partition τ of n. Given 1
Keywords
graph , Partition type , Hamiltonian cycle , Path , Labeled path , Orthogonally labeled , Partition , Middle Levels Conjecture
Journal title
Journal of Algebra
Serial Year
2003
Journal title
Journal of Algebra
Record number
696299
Link To Document