Distinguishing finite and infinite trees of arbitrary cardinality

Wilfried Imrich, Rafał Kalinowski, Florian Lehner +2

Let $G$ be a finite or infinite graph and $m(G)$ the minimum number of vertices moved by the non-identity automorphisms of $G$. We are interested in bounds on the supremum $\Delta (G)$ o…