Distinguishing Cartesian Products of Countable Graphs
Research output: Contribution to journal › Article › Research › peer-review
Standard
In: Discussiones mathematicae / Graph theory, Vol. 37.2017, No. 1, 01.12.2017, p. 155-164.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex - Download
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - Distinguishing Cartesian Products of Countable Graphs
AU - Estaji, Ehsan
AU - Imrich, Wilfried
AU - Kalinowski, Rafal
AU - Pilsniak, Monika
AU - Tucker, Thomas
PY - 2017/12/1
Y1 - 2017/12/1
N2 - The distinguishing number D(G) of a graph G is the minimum numberof colors needed to color the vertices of G such that the coloring is preservedonly by the trivial automorphism. In this paper we improve results aboutthe distinguishing number of Cartesian products of finite and infinite graphsby removing restrictions to prime or relatively prime factors.Keywords: vertex coloring, distinguishing number, automorphisms, infinitegraphs, Cartesian and weak Cartesian product.
AB - The distinguishing number D(G) of a graph G is the minimum numberof colors needed to color the vertices of G such that the coloring is preservedonly by the trivial automorphism. In this paper we improve results aboutthe distinguishing number of Cartesian products of finite and infinite graphsby removing restrictions to prime or relatively prime factors.Keywords: vertex coloring, distinguishing number, automorphisms, infinitegraphs, Cartesian and weak Cartesian product.
U2 - 10.7151/dmgt.1902
DO - 10.7151/dmgt.1902
M3 - Article
VL - 37.2017
SP - 155
EP - 164
JO - Discussiones mathematicae / Graph theory
JF - Discussiones mathematicae / Graph theory
SN - 1234-3099
IS - 1
ER -
