Distinguishing Cartesian Products of Countable Graphs

Distinguishing Cartesian Products of Countable Graphs

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...

Full description

Bibliographic Details
Main Authors: Estaji Ehsan, Imrich Wilfried, Kalinowski Rafał, Pilśniak Monika, Tucker Thomas
Format: Article
Language:English
Published: Sciendo 2017-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
vertex coloring
distinguishing number
automorphisms
infinite graphs
cartesian and weak cartesian product
05c25
05c15
03e10
Online Access:https://doi.org/10.7151/dmgt.1902

Internet

https://doi.org/10.7151/dmgt.1902

Similar Items