Distinguishing colorings of Cartesian products of complete graphs
Combinatorics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.math/0607465,
title = {Distinguishing colorings of Cartesian products of complete graphs},
author = {Michael J. Fisher and Garth Isaak},
journal= {arXiv preprint arXiv:math/0607465},
year = {2007}
}
Comments
11 pages. Submitted for publication