DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS

被引：11

作者：

Estaji, Ehsan ^{[1
]}

Imrich, Wilfried ^{[2
]}

Kalinowski, Rafal ^{[3
]}

Pilsniak, Monika ^{[3
]}

Tucker, Thomas ^{[4
]}

机构：

[1] Hakim Sabzevari Univ, Sabzevar, Iran

[2] Univ Leoben, A-8700 Leoben, Austria

[3] AGH Univ Sci & Technol, Dept Discrete Math, PL-30059 Krakow, Poland

[4] Colgate Univ, Hamilton, NY 13346 USA

来源：

DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 01期

关键词：

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

D O I：

10.7151/dmgt.1902

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：155 / 164

页数：10

共 50 条

[1] Distinguishing numbers of Cartesian products of multiple complete graphs
Fisher, Michael J.
Isaak, Garth
ARS MATHEMATICA CONTEMPORANEA, 2012, 5 (01) : 159 - 173
[2] DISTINGUISHING CHROMATIC NUMBER OF CARTESIAN PRODUCTS OF GRAPHS
Choi, Jeong Ok
Hartke, Stephen G.
Kaul, Hemanshu
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (01) : 82 - 100
[3] Distinguishing colorings of Cartesian products of complete graphs
Fisher, Michael J.
Isaak, Garth
DISCRETE MATHEMATICS, 2008, 308 (11) : 2240 - 2246
[4] The distinguishing chromatic number of Cartesian products of two complete graphs
Jerebic, Janja
Klavzar, Sandi
DISCRETE MATHEMATICS, 2010, 310 (12) : 1715 - 1720
[5] Distinguishing Cartesian powers of graphs
Imrich, Wilfried
Klavzar, Sandi
JOURNAL OF GRAPH THEORY, 2006, 53 (03) : 250 - 260
[6] Game distinguishing numbers of Cartesian products
Gravier, Sylvain
Meslem, Kahina
Schmidt, Simon
Slimani, Souad
ARS MATHEMATICA CONTEMPORANEA, 2018, 14 (01) : 39 - 54
[7] Cartesian products of directed graphs with loops
Imrich, Wilfried
Peterin, Iztok
DISCRETE MATHEMATICS, 2018, 341 (05) : 1336 - 1343
[8] Distinguishing number of hierarchical products of graphs
Amouzegar, Tayyebeh
BULLETIN DES SCIENCES MATHEMATIQUES, 2021, 168
[9] Distinguishing numbers and distinguishing indices of oriented graphs
Meslem, Kahina
Sopena, Eric
DISCRETE APPLIED MATHEMATICS, 2020, 285 : 330 - 342
[10] Distinguishing graphs with infinite motion and nonlinear growth
Cuno, Johannes
Imrich, Wilfried
Lehner, Florian
ARS MATHEMATICA CONTEMPORANEA, 2014, 7 (01) : 201 - 213

← 1 2 3 4 5 →