Distinguishing Cartesian Products of Countable Graphs
Ehsan Estaji ; Wilfried Imrich ; Rafał Kalinowski ; Monika Pilśniak ; Thomas Tucker
Discussiones Mathematicae Graph Theory, Tome 37 (2017), p. 155-164 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism. In this paper we improve results about the distinguishing number of Cartesian products of finite and infinite graphs by removing restrictions to prime or relatively prime factors.

Publié le : 2017-01-01
EUDML-ID : urn:eudml:doc:288086 
@article{bwmeta1.element.doi-10_7151_dmgt_1902,
     author = {Ehsan Estaji and Wilfried Imrich and Rafa\l\ Kalinowski and Monika Pil\'sniak and Thomas Tucker},
     title = {Distinguishing Cartesian Products of Countable Graphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {37},
     year = {2017},
     pages = {155-164},
     zbl = {1354.05065},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1902}
}

Ehsan Estaji; Wilfried Imrich; Rafał Kalinowski; Monika Pilśniak; Thomas Tucker. Distinguishing Cartesian Products of Countable Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 155-164. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1902/