Geodesic
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 1, pp. 155-164.

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: vertex coloring, distinguishing number, automorphisms, infinite graphs, Cartesian and weak Cartesian product 
@article{DMGT_2017_37_1_a11,
     author = {Estaji, Ehsan and Imrich, Wilfried and Kalinowski, Rafa{\l} and Pil\'sniak, Monika and Tucker, Thomas},
     title = {Distinguishing {Cartesian} {Products} of {Countable} {Graphs}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {155--164},
     publisher = {mathdoc},
     volume = {37},
     number = {1},
     year = {2017},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a11/}
}
TY  - JOUR
AU  - Estaji, Ehsan
AU  - Imrich, Wilfried
AU  - Kalinowski, Rafał
AU  - Pilśniak, Monika
AU  - Tucker, Thomas
TI  - Distinguishing Cartesian Products of Countable Graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2017
SP  - 155
EP  - 164
VL  - 37
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a11/
LA  - en
ID  - DMGT_2017_37_1_a11
ER  - 
%0 Journal Article
%A Estaji, Ehsan
%A Imrich, Wilfried
%A Kalinowski, Rafał
%A Pilśniak, Monika
%A Tucker, Thomas
%T Distinguishing Cartesian Products of Countable Graphs
%J Discussiones Mathematicae. Graph Theory
%D 2017
%P 155-164
%V 37
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a11/
%G en
%F DMGT_2017_37_1_a11
Estaji, Ehsan; Imrich, Wilfried; Kalinowski, Rafał; Pilśniak, Monika; Tucker, Thomas. Distinguishing Cartesian Products of Countable Graphs. Discussiones Mathematicae. Graph Theory, Tome 37 (2017) no. 1, pp. 155-164. http://geodesic.mathdoc.fr/item/DMGT_2017_37_1_a11/

[1] M.O. Albertson, Distinguishing Cartesian powers of graphs, Electron. J. Combin. 12 (2005) #N17.

[2] M.O. Albertson and K.L. Collins, Symmetry breaking in graphs, Electron. J. Combin. 3 (1996) #R18.

[3] R. Hammack, W. Imrich and S. Klavžar, Handbook of Product Graphs (Second Edition), (Taylor & Francis Group, 2011).

[4] W. Imrich, Automorphismen und das kartesische Produkt von Graphen, Österreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II 177 (1969) 203–214.

[5] W. Imrich, Über das schwache kartesische Produkt von Graphen, J. Combin. Theory Ser. B 11 (1971) 1–16. doi:10.1016/0095-8956(71)90008-6

[6] W. Imrich, J. Jerebic and S. Klavžar, The distinguishing number of Cartesian products of complete graphs, European J. Combin. 29 (2008) 922–929. doi:10.1016/j.ejc.2007.11.018

[7] W. Imrich and S. Klavžar, Distinguishing Cartesian powers of graphs, J. Graph Theory 53 (2006) 250–260. doi:10.1002/jgt.20190

[8] W. Imrich, S. Klavžar and V. Trofimov, Distinguishing infinite graphs, Electron. J. Combin. 14 (2007) #R36.

[9] S. Klavžar and X. Zhu, Cartesian powers of graphs can be distinguished by two labels, European J. Combin. 28 (2007) 303–310. doi:10.1016/j.ejc.2005.07.001

[10] D.J. Miller, The automorphism group of a product of graphs, Proc. Amer. Math. Soc. 25 (1970) 24–28. doi:10.1090/S0002-9939-1970-0262116-3

[11] D.J. Miller, Weak cartesian product of graphs, Colloq. Math. 21 (1970) 55–74.

[12] A. Russell and R. Sundaram, A note on the asymptotics and computational complexity of graph distinguishability, Electron. J. Combin. 5 (1998) #R2.

[13] G. Sabidussi, Graph multiplication, Math. Z. 72 (1959/1960) 446–457.

[14] S.M. Smith, T. Tucker and M.E. Watkins, Distinguishability of infinite groups and graphs, Electron. J. Combin. 19 (2012) #P27.

[15] V.G. Vizing, The Cartesian product of graphs, Vychisl. Sistemy 9 (1963) 30–43, in Russian.