Distinguishing chromatic number of Hamiltonian circulant graphs
| Autor: | Barrus, Michael D., Guillaume, Jean, Lantz, Benjamin |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | 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. Comment: 4 figures |
| Databáze: | arXiv |
| Externí odkaz: |
|