Total Global Dominator Coloring of Trees and Unicyclic Graphs
-
Published:2023-01-22
Issue:
Volume:
Page:
-
ISSN:2411-7986
-
Container-title:Baghdad Science Journal
-
language:
-
Short-container-title:Baghdad Sci.J
Author:
K. P. ChithraORCID,
Mayamma Joseph
Abstract
A total global dominator coloring of a graph is a proper vertex coloring of with respect to which every vertex in dominates a color class, not containing and does not dominate another color class. The minimum number of colors required in such a coloring of is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.
Publisher
College of Science for Women
Subject
General Physics and Astronomy,Agricultural and Biological Sciences (miscellaneous),General Biochemistry, Genetics and Molecular Biology,General Mathematics,General Chemistry,General Computer Science