Combinatorics Seminar Archive

May 04, 2007

The Distinguishing Chromatic Number of the Graph Cn o Im

Abstract: In this talk, we will extend the works of Collins and Trenk, by finding the distinguishing chromatic number of the graph Cn o Im, for n, m positive integers. We will first look at a couple of examples, starting with m = 2, and providing a theorem for Cn o I2, while also offering an example of a coloring scheme for each n and explain why the scheme works. We will then look at the case for m = 3, followed by the general case.