Distinguishing and Distinguishing Chromatic Numbers of Generalized Petersen Graphs

Albertson and Collins defined the distinguishing number of a graph to be the smallest number of colors needed to color its vertices so that the coloring is preserved only by the identity automorphism. Collins and Trenk followed by defining the distinguishing chromatic number of a graph to be the smallest size of a coloring that is both proper and distinguishing. We show that, with two exceptions, generalized Petersen graphs are 2-distinguishable and properly 3-distinguishable.

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

[2]  W. Imrich,et al.  Distinguishing Cartesian powers of graphs , 2006 .

[3]  Xuding Zhu,et al.  Cartesian powers of graphs can be distinguished by two labels , 2007, Eur. J. Comb..

[4]  Lenore Cowen,et al.  The distinguishing number of the hypercube , 2004, Discret. Math..

[5]  Debra L. Boutin,et al.  Using Determining Sets to Distinguish Kneser Graphs , 2007, Electron. J. Comb..

[6]  J. Graver,et al.  The groups of the generalized Petersen graphs , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Frank Harary,et al.  Destroying symmetry by orienting edges: Complete graphs and complete bigraphs , 2001, Discuss. Math. Graph Theory.

[8]  Michael O. Albertson Distinguishing Cartesian Powers of Graphs , 2005, Electron. J. Comb..

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