Endomorphism Breaking in Graphs

We introduce the 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 preserved by the trivial endomorphism. This generalizes the notion of the distinguishing number $D(G)$ of a graph $G$, which is defined for automorphisms instead of endomorphisms. As the number of endomorphisms can vastly exceed the number of automorphisms, the new concept opens challenging problems, several of which are presented here. In particular, we investigate relationships between $D_e(G)$ and the endomorphism motion of a graph $G$, that is, the least possible number of vertices moved by a nontrivial endomorphism of $G$. Moreover, we extend numerous results about the distinguishing number of finite and infinite graphs to the endomorphism distinguishing number.

[1]  Garth Isaak,et al.  Distinguishing colorings of Cartesian products of complete graphs , 2008, Discret. Math..

[2]  W. Imrich,et al.  Handbook of Product Graphs, Second Edition , 2011 .

[3]  Xiangqian Zhou,et al.  Distinguishability of Locally Finite Trees , 2007, Electron. J. Comb..

[4]  Alexander Russell,et al.  A Note on the Asymptotics and Computational Complexity of Graph Distinguishability , 1998, Electron. J. Comb..

[5]  S. Klavžar,et al.  Distinguishing labellings of group action on vector spaces and graphs , 2006 .

[6]  Vojtech Rödl,et al.  On the minimum order of graphs with given semigroup , 1984, J. Comb. Theory, Ser. B.

[7]  P. Erdos,et al.  Asymmetric graphs , 1963 .

[8]  Thomas W. Tucker,et al.  Distinguishing Maps , 2011, Electron. J. Comb..

[9]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[10]  Wilfried Imrich,et al.  Distinguishing graphs with infinite motion and nonlinear growth , 2014, Ars Math. Contemp..

[11]  Wilfried Imrich,et al.  Distinguishing Infinite Graphs , 2007, Electron. J. Comb..

[12]  Michael O. Albertson,et al.  Symmetry Breaking in Graphs , 1996, Electron. J. Comb..

[13]  Karen L. Collins,et al.  The Distinguishing Chromatic Number , 2006, Electron. J. Comb..

[14]  Wilfried Imrich,et al.  The distinguishing number of Cartesian products of complete graphs , 2008, Eur. J. Comb..

[15]  P. Rowlinson.  ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207) By CHRIS GODSIL and GORDON ROYLE: 439 pp., £30.50, ISBN 0-387-95220-9 (Springer, New York, 2001). , 2002 .

[16]  Thomas W. Tucker,et al.  Distinguishability of Infinite Groups and Graphs , 2012, Electron. J. Comb..