Distinguishing colorings of Cartesian products of complete graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
11 pages. Submitted for publication

Keywords

Combinatorics, 05C25

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/115040

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0607465
 http://arxiv.org/abs/math/0607465

Collections

arXiv