Author:
Lazuardi A R,Slamin ,Dafik ,Kurniawati E Y,Maylisa I N
Abstract
Abstract
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.
Subject
General Physics and Astronomy
Reference16 articles.
1. On local super antimagic face coloring of plane graphs;Anggraeni;IOP Conferrence series,2019
2. On some domination colorings of graphs;Guillaume;Journal Discrete Applied Mathematics,2017
3. On geodesic structures of weakly median graphs. Decomposition and octahedral graphs;March;Journal Discrete Mathematics,2006
4. Dominator and total dominator colorings in vague graphs;Lian;Engineering and Apllied Science Letters,2019
5. On antimagic labelings of disjoint union of complete s-partite graphs;Dafik;J. Combin Math. Combin. Comput,2008