[1] Burger, A.P., Cockayne, E.J., et al. (2004) Infinite Order Domination in Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 50, 179-194.
[2] Goddard, W., Hedetniemi, S.M. and Hedetniemi, S.T. (2005) Eternal Security in Graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 52, 169-180.
[3] Klostermeyer, W.F. and Mynhardt, C.M. (2016) Protecting a Graph with Mobile Guards. Applicable Analysis and Discrete Mathematics, 10, 1-29.
https://doi.org/10.2298/AADM151109021K
[4] Finbow, S., et al. (2015) Eternal Domination in 3 × n Grids. The Australasian Journal of Combinatorics, 61, 156-174.
[5] Messinger, M.E. and Delaney, A.Z. (2017) Closing the GAP: Eternal Domination on 3 × n Grids. Contributions to Discrete Mathematics, 12, 47-61.
[6] Mojdeh, D.A. and Ghameshlou, A.N. (2007) Domination in Jahangir Graph J2,m. International Journal of Contemporary Mathematical Sciences, 2, 1193-1199.
https://doi.org/10.12988/ijcms.2007.07122
[7] Goldwasser, J., Klostermeyer, W. and Mynhardt, C.M. (2013) Eternal Protection in Grid Graphs. Utilitas Mathematica, 91, 47-64.