Enumerations of universal cycles for k-permutations

Universal cycle for k-permutations is a cyclic arrangement in which each k-permutation appears exactly once as k consecutive elements. Enumeration problem of universal cycles for k-permutations is discussed and one new enumerating method is proposed in this paper. Accurate enumerating formulae are p...

Full description

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2022-09, Vol.345 (9), p.112975, Article 112975
Main Authors: Chang, Zuling, Xue, Jie
Format: Article
Language:English
Subjects:
Eigenvalue
Eulerian tour
k-permutation
Laplacian matrix
Universal cycle
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Universal cycle for k-permutations is a cyclic arrangement in which each k-permutation appears exactly once as k consecutive elements. Enumeration problem of universal cycles for k-permutations is discussed and one new enumerating method is proposed in this paper. Accurate enumerating formulae are provided when k=2,3.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2022.112975