Article ID Journal Published Year Pages File Type
4650513 Discrete Mathematics 2008 7 Pages PDF
Abstract

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

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Distinguishing colorings of Cartesian products of complete graphs
Authors
, ,