On Global Dominator Coloring on Mycielskian Graphs

Abstract

A graph  that has proper vertex coloring with dom-color classes and anti-dom-color classes assigned to each vertex is said to have a global dominator coloring. Our goal in this study is to determine the global dominator chromatic number bounds for both Mycielskian graphs and iterated Mycielskian graphs. In addition, we describe the graphs that attain the bounds.