Acknowledgement
The authors are thankful to the referee for the useful suggestions
References
- S. Balamurugan, P. Aristotle and V. Swaminathan, On Graphs whose Dom-chromatic and chromatic Strong Domination number is up to Four, International Journal of Pure and Applied Mathematics 119 (2018), 61-68.
- F. Harary, Graph Theory, Addison Wesley, Reading Massachusetts, USA, 1969.
- E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi and S.T. Hedetniemi, Roman Domination in Graphs, Discrete Mathematics 278 (2004), 11-22. https://doi.org/10.1016/j.disc.2003.06.004
- D. Gernert, Inequalities Between the Domination Number and the Chromatic Number of a Graph, Discrete Mathematics 76 (2004), 151-153. https://doi.org/10.1016/0012-365X(89)90308-7
- O. Favaron, H. Karami, R. Khoeilar and S.M. Sheikholeslami, On the Roman Domination Number of a Graph, Discrete Mathematics 309 (2009), 3447-3451. https://doi.org/10.1016/j.disc.2008.09.043
- J. Hopcroft and M.S.M. Krishnomoorthy, On the Harmonious Coloring of Graphs, SIAM Journal of Algebraic Discrete Methods 4 (1983), 306-311. https://doi.org/10.1137/0604032
- Z. Miller and D. Pritikin, The harmonious coloring number of a graph, Discrete Math. 93 (1991), 211-228. https://doi.org/10.1016/0012-365X(91)90257-3
- J. Mitchem, On the harmonious chromatic number of a graph, Discrete Math. 74 (1989), 151-157. https://doi.org/10.1016/0012-365X(89)90207-0