Open AccessThe total dominator coloring of dense, octahedral and queen’s graphs
Author(s) -
A. R. Lazuardi,
. Slamin,
Dafik Dafik,
Elsa Yuli Kurniawati,
I. N. Maylisa
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1832/1/012017
Subject(s) - brooks' theorem , graph coloring , vertex (graph theory) , list coloring , complete coloring , graph , combinatorics , mathematics , algorithm , line graph , graph power , 1 planar graph
Let G be a graph, then the dominator coloring of G is a proper coloring, in which every vertex of G dominates every vertex of at least one color class. The Total dominator coloring of graph is a proper coloring with extra property that every vertex in the graph properly dominates an entire color class. The total dominator chromatic number X d t ( G ) of G is the minimum number of color classes in a total dominator coloring of it. In this paper, total dominator coloring of dense, octahedral and queen’s graphs have been disscussed.