DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS

作者：Estaji Ehsan^*; Imrich Wilfried; Kalinowski Rafal; Pilsniak Monika; Tucker Thomas

来源：Discussiones Mathematicae - Graph Theory, 2017, 37(1): 155-164.

DOI：10.7151/dmgt.1902

• vertex coloring
• distinguishing number
• automorphisms
• infinite graphs
• Cartesian and weak Cartesian product

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.

• 出版日期2017-2