论文信息 - Distinguishing colorings of Cartesian products of complete graphs

Distinguishing colorings of Cartesian products of complete graphs

We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph K"s","t which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs.

Garth Isaak | Michael J. Fisher

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

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

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

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

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

[6] Garth Isaak,et al. Edge colored complete bipartite graphs with trivial automorphism groups , 2005 .

[7] Desh Ranjan,et al. Identity orientation of complete bipartite graphs , 2005, Discret. Math..

[8] Jacques Verstraëte,et al. A Note on Graphs Without Short Even Cycles , 2005, Electron. J. Comb..

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

[10] Dominique Dumont,et al. Grammaire de Ramanujan et arbres de Cayley , 1996, Electron. J. Comb..