Distinguishing colorings of Cartesian products of complete graphs

Simple item page
dc.creatorFisher, Michael J.
dc.creatorIsaak, Garth
dc.date2006-07-19
dc.date.accessioned2026-07-07T07:20:42Z
dc.date.available2026-07-07T07:20:42Z
dc.descriptionWe 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.
dc.description11 pages. Submitted for publication
dc.identifierhttps://arxiv.org/abs/math/0607465
dc.identifierhttp://arxiv.org/abs/math/0607465
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115040
dc.subjectCombinatorics
dc.subject05C25
dc.titleDistinguishing colorings of Cartesian products of complete graphs
dc.typetext

Files

Collections

arXiv