Number of Distinguishing Colorings and Partitions

Bahman Ahmadi, Fatemeh Alinaghipour, Mohammad Hadi Shekarriz

A vertex coloring of a graph $G$ is called distinguishing (or symmetry breaking) if no non-identity automorphism of $G$ preserves it, and the distinguishing number, shown by $D(G)$…