Abstract
The distinguishing number D( G ) of a graph G is the least cardinal d such that G has a labeling with d labels which is only preserved by the trivial automorphism. We show that the distinguishing number of infinite, locally finite, connected graphs G with infinite motion and growth o ( n 2 / log 2 n ) is either 1 or 2 , which proves the Infinite Motion Conjecture of Tom Tucker for this type of graphs. The same holds true for graphs with countably many ends that do not grow too fast. We also show that graphs G of arbitrary cardinality are 2 -distinguishable if every nontrivial automorphism moves at least uncountably many vertices m( G ) , where m( G ) ≥ ∣Aut( G )∣ . This extends a result of Imrich et al. to graphs with automorphism groups of arbitrary cardinality.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
