Article
Distinguishing Chromatic Number of Hamiltonian Circulant Graphs
arXiv.org
(2023)
Abstract
The distinguishing chromatic number of a graph G is the smallest number of colors needed to properly color the vertices of G so that the trivial automorphism is the only symmetry of G that preserves the coloring. We investigate the distinguishing chromatic number for Hamiltonian circulant graphs with maximum degree at most 4.
Keywords
- Combinatorics
Disciplines
Publication Date
2023
DOI
10.48550/arXiv.2303.13759
Citation Information
Michael D. Barrus, Jean Guillaume and Benjamin Lantz. "Distinguishing Chromatic Number of Hamiltonian Circulant Graphs" arXiv.org (2023) Available at: http://works.bepress.com/jean-guillaume/5/
Creative Commons license
This work is licensed under a Creative Commons CC_BY International License.