Total domination coloring of graphs

Title

Total domination coloring of graphs

Creator

Chithra K.P.; Joseph M.

Description

A total domination coloring of a graph G is a proper coloring of G in which open neighbourhood of each vertex contains at least one color class and each color class is dominated by at least one vertex. The minimum number of colors required for a total domination coloring of G is called the total domination chromatic number of G and is denoted by ctd(G). In this paper, we study the total domination chromatic number of some graph classes. The bounds of total domination chromatic number with respect to the graph parameters such as the domination number, chromatic number, total dominator chromatic number and total domination number are also studied. 2021 the author(s).

Source

Journal of Mathematical and Computational Science, Vol-11, No. 1, pp. 442-458.

Date

2021-01-01

Publisher

SCIK Publishing Corporation

Subject

Domination coloring; Dominator coloring; Total domination coloring; Total dominator coloring

Coverage

Chithra K.P., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, Karnataka, 560029, India; Joseph M., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, Karnataka, 560029, India

Rights

Restricted Access

Relation

ISSN: 19275307

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.28919/jmc/5073

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100205567&doi=10.28919%2fjmc%2f5073&partnerID=40&md5=2fde50d064c55716ff336fa0e421f20b