- Tytuł:
- Distinguishing Cartesian Products of Countable Graphs
- Autorzy:
-
Estaji, Ehsan
Imrich, Wilfried
Kalinowski, Rafał
Pilśniak, Monika
Tucker, Thomas - Powiązania:
- https://bibliotekanauki.pl/articles/31342144.pdf
- Data publikacji:
- 2017-02-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
vertex coloring
distinguishing number
automorphisms
infinite graphs
Cartesian and weak Cartesian product - Opis:
- 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.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2017, 37, 1; 155-164
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł