Distinguishing graphs with intermediate growth (Q2400107)

In this paper, the author considers two concepts related to graphs: distinguishability and growth. There are a number of mathematical invariants unchanged for isomorphic graphs and these two are characterised by another two numbers. The distinguishing number of a graph \(G\) is the smallest number \(d\) such that there is a labelling of the vertices of \(G\) with \(d\) labels which is not preserved by any non-trivial automorphism of \(G\). There are many results on the distinguishing number of graphs with several properties. In this paper, the author studies infinite, connected locally finite graphs and solve a conjecture of Tucker which says that every infinite, connected locally finite graph with infinite motion is \(2\)-distinguishable. The main result of this paper says that a connected graph with infinite motion and growth is \(2\)-distinguishable.