Gregor, Petr ;
Merino, Arturo ;
Mütze, Torsten
The Hamilton Compression of Highly Symmetric Graphs
Abstract
We say that a Hamilton cycle C = (x₁,…,x_n) in a graph G is ksymmetric, if the mapping x_i ↦ x_{i+n/k} for all i = 1,…,n, where indices are considered modulo n, is an automorphism of G. In other words, if we lay out the vertices x₁,…,x_n equidistantly on a circle and draw the edges of G as straight lines, then the drawing of G has kfold rotational symmetry, i.e., all information about the graph is compressed into a 360^∘/k wedge of the drawing. We refer to the maximum k for which there exists a ksymmetric Hamilton cycle in G as the Hamilton compression of G. We investigate the Hamilton compression of four different families of vertextransitive graphs, namely hypercubes, Johnson graphs, permutahedra and Cayley graphs of abelian groups. In several cases we determine their Hamilton compression exactly, and in other cases we provide close lower and upper bounds. The cycles we construct have a much higher compression than several classical Gray codes known from the literature. Our constructions also yield Gray codes for bitstrings, combinations and permutations that have few tracks and/or that are balanced.
BibTeX  Entry
@InProceedings{gregor_et_al:LIPIcs.MFCS.2022.54,
author = {Gregor, Petr and Merino, Arturo and M\"{u}tze, Torsten},
title = {{The Hamilton Compression of Highly Symmetric Graphs}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {54:154:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959772563},
ISSN = {18688969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16852},
URN = {urn:nbn:de:0030drops168529},
doi = {10.4230/LIPIcs.MFCS.2022.54},
annote = {Keywords: Hamilton cycle, Gray code, hypercube, permutahedron, Johnson graph, Cayley graph, abelian group, vertextransitive}
}
22.08.2022
Keywords: 

Hamilton cycle, Gray code, hypercube, permutahedron, Johnson graph, Cayley graph, abelian group, vertextransitive 
Seminar: 

47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)

Issue date: 

2022 
Date of publication: 

22.08.2022 