The distinguishing number of complete bipartite and crown graphs

Lei Chen, Alice Devillers, Luke Morgan +1

The distinguishing number of a permutation group $G\leqslant\Sym(Ω)$ is the minimum number of colours needed to colour $\Omega$ in such a way that the only colour preserving element of…