Distinguishing chromatic number of random Cayley graphs |
| |
Authors: | Niranjan Balachandran Sajith Padinhatteeri |
| |
Institution: | Department of Mathematics, Indian Institute of Technology Bombay, Mumbai, India |
| |
Abstract: | The distinguishing chromatic number of a graph , denoted , is defined as the minimum number of colors needed to properly color such that no non-trivial automorphism of fixes each color class of . In this paper, we consider random Cayley graphs defined over certain abelian groups with , and show that with probability at least , . |
| |
Keywords: | Distinguishing chromatic number Random Cayley graphs |
本文献已被 ScienceDirect 等数据库收录! |
|