Distinguishing Cartesian Products of Countable Graphs

• Autorzy: Ehsan Estaji , Wilfried Imrich , Rafał Kalinowski , Monika Pilśniak , Thomas Tucker
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

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

Kategorie tematyczne

• 05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
• 05C15: Coloring of graphs and hypergraphs
• 03E10: Ordinal and cardinal numbers

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 1
• Strony: 155-164

Daty

wydano

2017-02-01

otrzymano

2015-08-05

poprawiono

2016-03-07

zaakceptowano

2016-03-07

online

2017-01-13

Twórcy

autor

Ehsan Estaji

• Hakim Sabzevari University, Sabzevar,

autor

Wilfried Imrich

• Montanuniversität Leoben, A-8700 Leoben,

autor

Rafał Kalinowski

• AGH University, Department of Discrete Mathematics, 30-059 Krakow,

autor

Monika Pilśniak

• AGH University, Department of Discrete Mathematics, 30-059 Krakow,

autor

Thomas Tucker

• Colgate University, Hamilton NY 13346,

Identyfikatory

DOI

10.7151/dmgt.1902