Graph universal cycles of combinatorial objects
Graph universal cycles of combinatorial objects
复制标题
组合对象的通用循环图
DOI:
10.1016/j.aam.2021.102166
复制
发表时间:
2021
影响因子:
1.1
通讯作者:
Padilla, Cristobal
中科院分区:
文献类型:
--
作者:
Cantwell, Amelia;Geraci, Juliann;Godbole, Anant;Padilla, Cristobal
A connected digraph in which the in-degree of any vertex equals its out-degree is Eulerian; this baseline result is used as the basis of existence proofs for universal cycles (also known as ucycles or generalized deBruijn cycles or U-cycles) of several combinatorial objects. The existence of ucycles is often dependent on the specific representation that we use for the combinatorial objects. For example, should we represent the subset {2, 5} of {1, 2, 3, 4, 5} as “25” in a linear string? Is the representation “52” acceptable? Or is it tactically advantageous (and acceptable) to go with {0, 1, 0, 0, 1}? In this paper, we represent combinatorial objects as graphs, as in [3], and exhibit the flexibility and power of this representation to produce graph universal cycles, or Gucycles, for k-subsets of an n-set; permutations (and classes of permutations) of [n]={1, 2,…, n}, and partitions of an n-set, thus revisiting the classes first studied in [5]. Under this graphical scheme, we will represent {2, 5} as the subgraph A of C 5 with edge set consisting of {2, 3} and {5, 1}, namely the “second” and “fifth” edges in C 5. Permutations are represented via their permutation graphs, and set partitions through disjoint unions of complete graphs.
登录
查看更多内容
影响因子:
0.8
作者:
Victoria Horan;G. Hurlbert
通讯作者:
G. Hurlbert
影响因子:
0.7
作者:
Yevgeniy Rudoy
通讯作者:
Yevgeniy Rudoy
影响因子:
0.8
作者:
Antonio Blanca;A. Godbole
通讯作者:
A. Godbole
影响因子:
--
作者:
Andre A Campbell;A. Godbole;Bill Kay
通讯作者:
Bill Kay