Distinguishing chromatic number of Hamiltonian circulant graphs

• DOI: 10.48550/arxiv.2303.13759
• Publication Date: 2023-01-01
• Authors: Michael D. Barrus; Jean Guillaume; Benjamin J. Lantz
• Keywords: Circulant graph; Hamiltonian (control theory)

The distinguishing chromatic number of a graph $G$ is the smallest colors needed to properly color vertices so that trivial automorphism only symmetry preserves coloring. We investigate for Hamiltonian circulant graphs with maximum degree at most 4.