Total Global Dominator Coloring of Trees and Unicyclic Graphs

Title

Total Global Dominator Coloring of Trees and Unicyclic Graphs

Creator

Chithra K.P.; Joseph M.

Description

A total global dominator coloring of a graph G is a proper vertex coloring of G with respect to which every vertex v in V dominates a color class, not containing v and does not dominate another color class. The minimum number of colors required in such a coloring of G is called the total global dominator chromatic number, denoted by Xtgd (G). In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored. 2023 University of Baghdad. All rights reserved.

Source

Baghdad Science Journal, Vol-20, No. 4, pp. 1380-1386.

Date

2023-01-01

Publisher

University of Baghdad

Subject

Global dominator coloring; Total domination number; Total dominator coloring; Total global domination number; Total global dominator coloring; Trees; Unicyclic graphs

Coverage

Chithra K.P., Department of Mathematics, Christ University, Karnataka, Bangalore, 560029, India; Joseph M., Department of Mathematics, Christ University, Karnataka, Bangalore, 560029, India

Rights

All Open Access; Gold Open Access

Relation

ISSN: 20788665

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.21123/bsj.2023.6457

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85173481589&doi=10.21123%2fbsj.2023.6457&partnerID=40&md5=6b5ad19298a8604b06a63efbab3d1229