On fixing and distinguishing numbers of trees

Calum Buchanan, Peter Dankelmann, Isabel Harris +3

A graph $G$ is $D$-distinguishable if there is a labeling of its vertices with $D$ labels such that the only automorphism of $G$ which preserves the labeling is the identity. The d…