References
- H. Abdollahzadeh Ahangar, M. Chellali and S.M. Sheikholeslami, On the double Roman domination in graphs, Disrete Appl. Math. 232 (2017), 1-7. doi: 10.1016/j.dam.2017.06.014
- J. Amjadi, S.M. Sheikholeslami and L. Volkmann, Global rainbow domination in graphs, Miskolc Math. Notes 17 (2016), 749–759. doi: 10.18514/MMN.2017.1267
- S. Arumugam, I. S. Hamid and K. Karuppasamy, Fractional global domination in graphs, Discuss. Math. Graph Theory 30 (2010), 33–44. doi: 10.7151/dmgt.1474
- M. Atapour, S. Norouzian and S.M. Sheikholeslami, Global minus domination in graphs, Trans. Comb. 3 (2014), 35–44.
- M. Atapour, S.M. Sheikholeslami, and L. Volkmann, Global Roman domination in graphs, Graphs Combin. 31 (2015), 813–825. doi: 10.1007/s00373-014-1415-3
- R.A. Beeler, T.W. Haynes and S.T. Hedetniemi, Double Roman domination, Discrete Appl. Math. 211 (2016), 23–29. doi: 10.1016/j.dam.2016.03.017
- E. J. Cockayne, P. A. Dreyer, S M. Hedetniemi and S. T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (1-3) (2004), 11–22. doi: 10.1016/j.disc.2003.06.004
- D. Delić and C. Wang, The global connected domination in graphs, Ars Combin. 114 (2014), 105–110.
- O. Favaron, H. Karami, R. Khoeilar, and S.M. Sheikholeslami, On the Roman domination number of a graph, Discrete Math. 309 (2009), 3447– 3451. doi: 10.1016/j.disc.2008.09.043
- T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in graphs, Marcel Dekker, Inc., New York, 1998.
- V. R. Kulli and B. Janakiram, The total global domination number of a graph, India J. Pure Appl. Math. 27 (1996), 537–542.
- N. Jafari Rad and S. Sheikholeslami, Roman reinforcement in graphs, Bulletin of the Institute of Combinatorics and its Applications 61 (2011), 81–90.
- C.-H. Liu and G. J. Chang, Roman domination on 2-connected graphs, SIAM J. Discrete Math. 26 (2012), 193–205. doi: 10.1137/080733085
- C.-H. Liu and G. J. Chang, Upper bounds on Roman domination numbers of graphs, Discrete Math. 312 (2012), 1386–1391. doi: 10.1016/j.disc.2011.12.021
- C.-H. Liu and G. J. Chang, Roman domination on strongly chordal graphs, J. Comb. Optim. 26 (2013), 608–619. doi: 10.1007/s10878-012-9482-y
- P. PavliČ and J. Žerovnik, Roman domination number of the Cartesian products of paths and cycles, Electron. J. Combin. 19 (2012), #P19.
- P. Roushini Leely Pushpam and T. N. M. Malini Mai, Roman domination in unicyclic graphs, Journal of Discrete Mathematical Sciences & Cryptography, 15 (2012), 237-257. doi: 10.1080/09720529.2012.10698378
- E. Sampathkumar, The global domination number of a graph, J. Math. Phy. Sci. 23 (1989), 377–385.
- I. Stewart, Defend the Roman Empire, Sci. Amer. 281 (6) (1999), 136-139. doi: 10.1038/scientificamerican1299-136
- S. Wang and B. Wei, A note on the independent domination number versus the domination number in bipartite graphs, Czechoslovak Mathematical Journal, 67 (142) (2017), 533–536. doi: 10.21136/CMJ.2017.0068-16
- X. Zhang, Z. Li, H. Jiang and Z. Shao, Double Roman domination in trees, Information Processing Letters, 134 (2018), 31-34. doi: 10.1016/j.ipl.2018.01.004
- V. Zverovich and A. Poghosyan, On Roman, global and restrained domination in graphs, Graphs Combin. 27 (2011), 755–768. doi: 10.1007/s00373-010-0992-z
- I. G. Yero and J. A. Rodrguez-Velázquez, Roman domination in Cartesian product graphs and strong product graphs, Appl. Anal. Discrete Math. 7 (2013), 262–274. doi: 10.2298/AADM130813017G