arXiv Analytics

Sign in

arXiv:math/0607465 [math.CO]AbstractReferencesReviewsResources

Distinguishing colorings of Cartesian products of complete graphs

Michael J. Fisher, Garth Isaak

Published 2006-07-19Version 1

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.

Comments: 11 pages. Submitted for publication
Categories: math.CO
Subjects: 05C25
Related articles: Most relevant | Search more
arXiv:1401.7929 [math.CO] (Published 2014-01-30, updated 2015-02-16)
On Path-Pairability of Cartesian Product of Complete Bipartite Graphs
arXiv:1508.02594 [math.CO] (Published 2015-08-11)
On the safe set of Cartesian product of two complete graphs
arXiv:1504.01975 [math.CO] (Published 2015-04-08)
On the b-chromatic number of the Cartesian product of two complete graphs

Links

Toolbox