Ahangar Abdollahzadeh, H., Henning, M., Samodivkin, V., & Yero, I. (2016). Total Roman domination in graphs. Applicable Analysis and Discrete Mathematics, 10(2), 501-517. doi:10.2298/aadm160802017a
Amjadi, J., Sheikholeslami, S. M., & Soroudi, M. (2019). On the total Roman domination in trees. Discussiones Mathematicae Graph Theory, 39(2), 519. doi:10.7151/dmgt.2099
Cabrera Martínez, A., Cabrera García, S., & Carrión García, A. (2020). Further Results on the Total Roman Domination in Graphs. Mathematics, 8(3), 349. doi:10.3390/math8030349
[+]
Ahangar Abdollahzadeh, H., Henning, M., Samodivkin, V., & Yero, I. (2016). Total Roman domination in graphs. Applicable Analysis and Discrete Mathematics, 10(2), 501-517. doi:10.2298/aadm160802017a
Amjadi, J., Sheikholeslami, S. M., & Soroudi, M. (2019). On the total Roman domination in trees. Discussiones Mathematicae Graph Theory, 39(2), 519. doi:10.7151/dmgt.2099
Cabrera Martínez, A., Cabrera García, S., & Carrión García, A. (2020). Further Results on the Total Roman Domination in Graphs. Mathematics, 8(3), 349. doi:10.3390/math8030349
A. Cabrera Martínez, J.A. Rodríguez-Velázquez, Total protection of lexicographic product graphs, Discuss. Math. Graph Theory, in press.
Campanelli, N., & Kuziak, D. (2019). Total Roman domination in the lexicographic product of graphs. Discrete Applied Mathematics, 263, 88-95. doi:10.1016/j.dam.2018.06.008
Cockayne, E. J., Dawes, R. M., & Hedetniemi, S. T. (1980). Total domination in graphs. Networks, 10(3), 211-219. doi:10.1002/net.3230100304
Dettlaff, M., Lemańska, M., Rodríguez-Velázquez, J. A., & Zuazua, R. (2019). On the super domination number of lexicographic product graphs. Discrete Applied Mathematics, 263, 118-129. doi:10.1016/j.dam.2018.03.082
Dorbec, P., Mollard, M., Klavžar, S., & Špacapan, S. (2008). Power Domination in Product Graphs. SIAM Journal on Discrete Mathematics, 22(2), 554-567. doi:10.1137/060661879
Hajian, M., & Rad, N. J. (2019). A new lower bound on the double domination number of a graph. Discrete Applied Mathematics, 254, 280-282. doi:10.1016/j.dam.2018.06.009
Harant, J., & Henning, M. . A. (2005). On Double Domination in Graphs. Discussiones Mathematicae Graph Theory, 25(1-2), 29. doi:10.7151/dmgt.1256
Chellali, M., & Khelifi, S. (2012). Double domination critical and stable graphs upon vertex removal. Discussiones Mathematicae Graph Theory, 32(4), 643. doi:10.7151/dmgt.1633
Liu, C.-H., & Chang, G. J. (2012). Roman domination on strongly chordal graphs. Journal of Combinatorial Optimization, 26(3), 608-619. doi:10.1007/s10878-012-9482-y
Nowakowski, R. J., & Rall, D. F. (1996). Associative graph products and their independence, domination and coloring numbers. Discussiones Mathematicae Graph Theory, 16(1), 53. doi:10.7151/dmgt.1023
Šumenjak, T. K., Rall, D. F., & Tepeh, A. (2013). Rainbow domination in the lexicographic product of graphs. Discrete Applied Mathematics, 161(13-14), 2133-2141. doi:10.1016/j.dam.2013.03.011
Šumenjak, T. K., Pavlič, P., & Tepeh, A. (2012). On the Roman domination in the lexicographic product of graphs. Discrete Applied Mathematics, 160(13-14), 2030-2036. doi:10.1016/j.dam.2012.04.008
Valveny, M., Pérez-Rosés, H., & Rodríguez-Velázquez, J. A. (2019). On the weak Roman domination number of lexicographic product graphs. Discrete Applied Mathematics, 263, 257-270. doi:10.1016/j.dam.2018.03.039
[-]