Orthogonal Colourings of Cayley Graphs
Abstract
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal colourings of Cayley graphs are discussed. Firstly, the orthogonal chromatic number of cycle graphs are completely determined. Secondly, the orthogonal chromatic number of certain circulant graphs is explored. Lastly, orthogonal colourings of product graphs and Hamming graphs are studied.
- Publication:
-
arXiv e-prints
- Pub Date:
- October 2019
- DOI:
- 10.48550/arXiv.1910.14454
- arXiv:
- arXiv:1910.14454
- Bibcode:
- 2019arXiv191014454M
- Keywords:
-
- Mathematics - Combinatorics
- E-Print:
- 13 pages, 4 figures