DeepAI
Log In Sign Up

The Hamilton compression of highly symmetric graphs

05/17/2022
by   Petr Gregor, et al.
0

We say that a Hamilton cycle C=(x_1,…,x_n) in a graph G is k-symmetric, 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_1,…,x_n equidistantly on a circle and draw the edges of G as straight lines, then the drawing of G has k-fold 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 k-symmetric Hamilton cycle in G as the Hamilton compression of G. We investigate the Hamilton compression of four different families of vertex-transitive 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.

READ FULL TEXT

page 3

page 4

page 19

page 22

page 23

page 30

page 32

03/20/2020

Flexible placements of graphs with rotational symmetry

We study the existence of an n-fold rotationally symmetric placement of ...
02/14/2022

Codes with structured Hamming distance in graph families

We investigate the maximum size of graph families on a common vertex set...
02/20/2021

Making an H-Free Graph k-Colorable

We study the following question: how few edges can we delete from any H-...
05/29/2014

JPEG Noises beyond the First Compression Cycle

This paper focuses on the JPEG noises, which include the quantization no...
09/30/2022

Graphs with the same truncated cycle matroid

The classical Whitney's 2-Isomorphism Theorem describes the families of ...
09/24/2022

Compressing bipartite graphs with a dual reordering scheme

In order to manage massive graphs in practice, it is often necessary to ...