Distinguishing colorings of Cartesian products of complete graphs

2006/07/19 by Michael J. Fisher, Fisher, Michael J., Garth Isaak +1
Mathematics · #05C25 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C25

paper · pdf · doi:10.48550/arxiv.math/0607465

11 pages. Submitted for publication

arxiv created 2006/07/19 · arxiv updated 2009/12/01

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.

Related

• The Cost of Edge-distinguishing of the Cartesian Product of Connected Graphs
• On the b-chromatic number of the Cartesian product of two complete graphs
• On the achromatic number of the Cartesian product of two complete graphs
• Distinguishing Polynomials of Graphs
• Game Distinguishing Numbers of Cartesian Products of Graphs