Highly Influenced

# Distinguishing colorings of Cartesian products of complete graphs

@article{Fisher2008DistinguishingCO, title={Distinguishing colorings of Cartesian products of complete graphs}, author={Michael J. Fisher and Garth Isaak}, journal={Discrete Mathematics}, year={2008}, volume={308}, pages={2240-2246} }

- Published 2008 in Discrete Mathematics
DOI:10.1016/j.disc.2007.04.070

We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph Ks,t which admits only the identity automorphism. In particular this allows us to determine the distinguishing number of the Cartesian product of complete graphs. The distinguishing number of a graph is the minimum number of colors needed to label the vertices so that the only color preserving automorphism is the identity. The distinguishing number was introduced by Albertson and… CONTINUE READING

Highly Cited

This paper has 18 citations. REVIEW CITATIONS

#### From This Paper

##### Topics from this paper.

11 Citations

11 References

Similar Papers