Repository of colleges and higher education institutions

Show document
A+ | A- | Help | SLO | ENG

Title:The Hamilton Compression of Highly Symmetric Graphs
Authors:ID Gregor, Petr (Author)
ID Merino, Arturo (Author)
ID Mütze, Torsten (Author)
Files:URL https://link.springer.com/article/10.1007/s00026-023-00674-y
 
.pdf s00026-023-00674-y.pdf (2,12 MB)
MD5: A946F8097294C08784D83365BDDBA115
 
Language:English
Work type:Unknown
Typology:1.01 - Original Scientific Article
Organization:FIŠ - Faculty of Information Studies in Novo mesto
Abstract:We say that a Hamilton cycle in a graph G is k-symmetric, if the mapping for all, where indices are considered modulo n, is an automorphism of G. In other words, if we lay out the vertices 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 wedge of the drawing. The maximum k for which there exists a k-symmetric Hamilton cycle in G is referred to 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 constructed cycles 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.
Keywords:Hamilton cycle, Gray code, Hypercube, Permutahedron, Johnson graph, Cayley graph, Abelian group, Vertex-transitive
Publication status:Published
Publication version:Version of Record
Publication date:13.12.2023
Year of publishing:2024
Number of pages:str. 379–437
Numbering:Vol. 28, iss. 2
PID:20.500.12556/ReVIS-11892 New window
COBISS.SI-ID:241147139 New window
UDC:51
ISSN on article:0218-0006
DOI:10.1007/s00026-023-00674-y New window
Publication date in ReVIS:02.07.2025
Views:38
Downloads:0
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Annals of combinatorics
Shortened title:Ann. comb.
Publisher:Springer Singapore, Birkhäuser
ISSN:0218-0006
COBISS.SI-ID:8204633 New window

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0383
Name:Kompleksna omrežja

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:Hamiltonov cikel, Grayjeva koda, Hiperkocka, Permutahidron, Johnsonov graf, Cayleyev graf, Abelova grupa, ogliščno-tranzitiven


Back