Endomorphism Breaking in Graphs

Wilfried Imrich, Rafał Kalinowski, Florian Lehner +1

We introduce the {\it endomorphism distinguishing number} $D_e(G)$ of a graph $G$ as the least cardinal $d$ such that $G$ has a vertex coloring with $d$ colors that is only preserv…