[1] G. Chartrand, L. Lesniak, and P. Zhang, Graphs and Digraphs, Chapman & Hall London, 1996.
[2] M. Chellali, N. Jafari Rad, S.M. Sheikholeslami, and L. Volkmann, Roman domination in graphs, Topics in domination in graphs (T.W. Haynes, S.T. Hedetniemi, and M.A. Henning, eds.), Springer Cham, 2020, pp. 365–409.
[5] T.W. Haynes, S. Hedetniemi, and P. Slater, Fundamentals of Domination in Graphs, CRC press, 2013.
[6] T.W. Haynes, S. Hedetniemi, and P. Slater, Domination in Graphs: Volume 2: Advanced Topics, CRC Press, 2017.
[7] C.X. Kang, Total domination value in graphs, Util. Math. 95 (2014), 263–279.
[8] C.M. Mynhardt, Vertices contained in every minimum dominating set of a tree, J. Graph Theory 31 (1999), no. 3, 163–177.
[10] P.R.L. Pushpam and S. Padmapriea, On total Roman domination in graphs, Theoretical Computer Science and Discrete Mathematics (Cham) (S. Arumugam, J. Bagga, L.W. Beineke, and B.S. Panda, eds.), Springer International Publishing, 2017, p. 326–331.
[11] P.R.L. Pushpam and S. Padmapriea, Forcing Roman domination in graphs, Congr. Numer. 25 (2018), no. 6–7, 441–453.
[12] P.J. Slater, The Hedetniemi number of a graph, Congr. Numer. 139 (1999), 65–75.
[13] I. Stewart, Defend the Roman Empire!, Sci. Am. 281 (1999), no. 6, 136–138.
[14] E. Yi, Domination value in graphs, Contrib. Discrete Math. 7 (2012), no. 2, 30–43.
[15] E. Yi, Domination value in P2 × Pn and P2 × Cn, J. Combin. Math. Combin. Comput. 82 (2012), 59–75.