1 research outputs found
Distinguishing Chromatic Number of Random Cayley graphs
The \textit{Distinguishing Chromatic Number} of a graph , denoted
, was first defined in \cite{collins} as the minimum number of
colors needed to properly color such that no non-trivial automorphism
of the graph fixes each color class of . In this paper, we
consider random Cayley graphs defined over certain abelian groups
and show that with probability at least we have,
.Comment: 11 page