Abstract
The distinguishing chromatic number of a graph G, denoted χD(G), is defined as the minimum number of colors needed to properly color G such that no non-trivial automorphism of G fixes each color class of G. In this paper, we consider random Cayley graphs Γ defined over certain abelian groups A with |A|=n, and show that with probability at least 1−n−Ω(logn), χD(Γ)≤χ(Γ)+1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
