Dominator and total dominator coloring of circulant graph Cn (1, 2)

被引：2

作者：

Chen, Qin ^{[1
]}

机构：

[1] China Jiliang Univ, Coll Sci, Hangzhou 310018, Peoples R China

来源：

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY | 2022年 / 25卷 / 08期

关键词：

Dominator coloring; Total dominator coloring; Dominator chromatic number; Total dominator chromatic number; Circulant graph; CHROMATIC NUMBER;

D O I：

10.1080/09720529.2021.1885807

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A dominator coloring (resp. total dominator coloring) of a graph G is a proper coloring of the vertices of G in which each closed neighborhood (resp. open neighborhood) of every vertex of G contains a color class. The dominator chromatic number (resp. total dominator chromatic number) of G is the minimum number of colors required for a dominator coloring (resp. total dominator coloring) of G. In this paper, we determine the dominator chromatic number and total dominator chromatic number of the circulant graph C-n (1, 2).

引用

页码：2549 / 2567

页数：19

共 50 条

[41] The metric dimension of the circulant graph with 2k generators can be less than k [J].

Vetrik, Tomas ;

Imran, Muhammad ;

Knor, Martin ;

Skrekovski, Riste .

JOURNAL OF KING SAUD UNIVERSITY SCIENCE, 2023, 35 (07)

[42] Coloring of the Square of Kneser Graph K (2k plus r, k) [J].

Kim, Seog-Jin ;

Park, Boram .

GRAPHS AND COMBINATORICS, 2016, 32 (04) :1461-1472

[43] Packing (1,1,2,2)-coloring of some subcubic graphs [J].

Liu, Runrun ;

Liu, Xujun ;

Rolek, Martin ;

Yu, Gexin .

DISCRETE APPLIED MATHEMATICS, 2020, 283 :626-630

[44] Packing (1,1,2,4)-coloring of subcubic outerplanar graphs [J].

Kostochka, Alexandr ;

Liu, Xujun .

DISCRETE APPLIED MATHEMATICS, 2021, 302 :8-15

[45] On the Domination Number of the Circulant Graphs C(n; {1, 2}), C(n; {1, 3}) and C(n; {1, 4}) [J].

Fu Xueliang ;

Yang Yuansheng ;

Jiang Baoqi .

ARS COMBINATORIA, 2011, 102 :173-182

[46] Every subcubic graph is packing (1,1,2,2,3)-colorable [J].

Liu, Xujun ;

Zhang, Xin ;

Zhang, Yanting .

DISCRETE MATHEMATICS, 2025, 348 (11)

[47] L(2,1)-Labeling of Kneser graphs and coloring squares of Kneser graphs [J].

Shao, Zhendong ;

Averbakh, Igor ;

Solis-Oba, Roberto .

DISCRETE APPLIED MATHEMATICS, 2017, 221 :106-114

[48] Coloring {P2 U P3, house}-free graphs with △-1 colors [J].

Chen, Rong ;

Lan, Kaiyang ;

Zhou, Yidong .

DISCRETE APPLIED MATHEMATICS, 2024, 342 :12-18

[49] A note on the chromatic number of the square of Kneser graph K(2k+1, k) [J].

Kang, Jeong-Hyun ;

Kaul, Hemanshu .

DISCRETE MATHEMATICS, 2020, 343 (0I)

[50] A new approach to the chromatic number of the square of Kneser graph K(2k 1, k) [J].

Kang, Jeong-Hyun .

DISCRETE MATHEMATICS, 2018, 341 (01) :96-103

← 1 2 3 4 5 →