Distinguishing Cartesian Products of Countable Graphs

Publikationen: Beitrag in FachzeitschriftArtikelForschung(peer-reviewed)

Autoren

Externe Organisationseinheiten

  • Hakim Sabzevari University
  • Berg- und Hüttenakademie Krakau
  • Colgate University

Abstract

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.

Details

OriginalspracheEnglisch
Seiten (von - bis)155-164
Seitenumfang10
FachzeitschriftDiscussiones mathematicae / Graph theory
Jahrgang37.2017
Ausgabenummer1
DOIs
StatusVeröffentlicht - 1 Dez. 2017