DOMINATOR CHROMATIC NUMBER OF CENTRAL GRAPH OF SOME GRAPHS

被引：0

作者：

Karpagavalli, S. ^{[1
]}

Kaviyarasi, B. ^{[2
]}

机构：

[1] Bharathi Womens Coll, Dept Math, Chennai 600021, Tamil Nadu, India

[2] Queen Marys Coll, Dept Math, Chennai 600004, Tamil Nadu, India

来源：

ADVANCES AND APPLICATIONS IN MATHEMATICAL SCIENCES | 2021年 / 20卷 / 09期

关键词：

Coloring; Dominator number; Dominator coloring; Dominator chromatic number;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G = (V, E) be a simple, connected, undirected and finite graph. In this paper, we obtain the dominator chromatic number of central graph of Cocktail party graph, n-Antiprism graph, Musical graph. A graph G has a dominator coloring if it has a proper coloring in which each vertex of the graph dominates every vertex of some color class. The minimum number of color classes needed for the dominator coloring of a graph G is the dominator chromatic number and is denoted by chi(d)(G).

引用

页码：1697 / 1707

页数：11