Title of article
Distinguishing colorings of Cartesian products of complete graphs Original Research Article
Author/Authors
Michael J. Fisher-White ، نويسنده , , Garth Isaak، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
7
From page
2240
To page
2246
Abstract
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph image which admits only the identity automorphism. In particular, this allows us to determine the distinguishing number of the Cartesian product of complete graphs.
Keywords
Edge coloring , Automorphism , Distinguishing number
Journal title
Discrete Mathematics
Serial Year
2008
Journal title
Discrete Mathematics
Record number
947308
Link To Document