References
- A.P. Burger, E.J. Cockayne, W.R. Gru¨ndlingh, C.M. Mynhardt, J.H. van Vuuren and W. Winterbach, Finite order domination in graphs, Journal of Com- binatorial Mathematics and Combinatorial Computing 49 (2004), 159–175.
- A.P. Burger, E.J. Cockayne, W.R. Gru¨ndlingh, C.M. Mynhardt, J.H. van Vuuren and W. Winterbach, Infinite order domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 50 (2004), 179–194.
- A.P. Burger, M.A. Henning and J.H. van Vuuren, Vertex covers and secure domination in graphs, Quaestiones Mathematicae 31(2) (2008), 163–171.
- E.J. Cockayne, Irredundance, secure domination and maximum degree in trees, Discrete Mathematics 307 (2007), 12–17.
- E.J. Cockayne, O. Favaron and C.M. Mynhardt, Secure domination, weak ro- man domination and forbidden subgraphs, Bulletin of the Institute of Combinatorics and its Applications 39 (2003), 87–100.
- E.J. Cockayne, P.J.P. Grobler, W.R. Gru¨ndlingh, J. Munganga and J.H. van Vuuren, Protection of a graph, Utilitas Mathematica 67 (2005), 19–32.
- P.J.P. Grobler and C.M. Mynhardt, Secure domination critical graphs, Discrete Mathematics 309 (2009), 5820–5827.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of domination in graphs, Marcel Dekker, New York, 1998.
- C.M. Mynhardt, H.C. Swart and E. Ungerer, Excellent trees and secure domi- nation, Utilitas Mathematica 67 (2005), 255–267.