Distinguishing colorings of Cartesian products of complete graphs

Details Distinguishing colorings of Cartesian products of complete graphs Distinguishing colorings of Cartesian products of complete graphs

2006-07-19

arxiv.org/abs/math/0607465v1

Mathematics

Combinatorics

11 pages. Submitted for publication

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distinguishing colorings of Cartesian products of complete graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distinguishing colorings of Cartesian products of complete graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distinguishing colorings of Cartesian products of complete graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-625839