[1] A.M. Abid and T.R. Ramesh Rao, Dominator coloring of Mycielskian graphs, Australas. J. Combin. 73 (2019), 274–279.
[3] R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, second ed., Universitext, Springer, New York, 2012.
[4] S. Brandt, Triangle-free graphs whose independence number equals the degree, Discrete Math. 310 (2010), no. 3, 662–669.
[5] G. Chartrand, L. Lesniak, and P. Zhang, Graphs & Digraphs, sixth ed., Textbooks in Mathematics, CRC Press, Boca Raton, FL, 2016.
[6] X.G. Chen and H.M. Xing, Domination parameters in Mycielski graphs, Util. Math. 71 (2006), 235–244.
[7] R. Gera, C. Rasmussen, and S. Horton, Dominator colorings and safe clique partitions, Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol. 181, 2006, pp. 19–32.
[8] R.M. Gera, On dominator colorings in graphs, Graph Theory Notes N.Y. 52 (2007), 25–30.
[9] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, 1998.
[11] I. Sahul Hamid and M. Rajeswari, Global dominator coloring of graphs, Discuss. Math. Graph Theory 39 (2019), no. 2, 325–339.
http://doi.org/10.7151/dmgt.2089