A. Burger, E. Cockayne, W. Gr¨undlinghgr¨-gr¨undlingh, C. Mynhardt, J. Van-vuuren-&-w et al., Finite order domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.49, pp.159-175, 2004.

A. Burger, E. Cockayne, W. Gr¨undlinghgr¨-gr¨undlingh, C. Mynhardt, J. Van-vuuren-&-w et al., Infinite order domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.50, pp.179-194, 2004.

A. Burger, A. De, . Van, and . Vuuren, Edge criticality in secure graph domination, Discrete Optimization, vol.18
DOI : 10.1016/j.disopt.2015.08.001

A. Burger, A. De, . Van, and . Vuuren, The cost of edge failure with respect to secure graph domination, pp.329-339, 2014.

A. Burger, A. De, . Van, and . Vuuren, On minimum secure dominating sets of graphs, Quaestiones Mathematicae, vol.39, issue.2
DOI : 10.2989/16073606.2015.1068238

A. Burger, M. Henning-&, . Van, and . Vuuren, Vertex Covers and Secure Domination in Graphs, Quaestiones Mathematicae, vol.31, issue.2, pp.163-171, 2008.
DOI : 10.2989/QM.2008.31.2.5.477

E. Cockayne, O. Favaron, . Cm, and . Mynhardt, Secure domination, weak roman domination and forbidden subgraphs, Bulletin of the Institute of Combinatorics and its Applications, pp.87-100, 2003.

E. Cockayne, P. Grobler, W. Gr¨undlinghgr¨-gr¨undlingh, J. Van, and . Vuuren, Protection of a graph, pp.19-32, 2005.

P. Grobler, . Cm, and . Mynhardt, Secure domination critical graphs, Discrete Mathematics, vol.309, issue.19, pp.5820-5827, 2009.
DOI : 10.1016/j.disc.2008.05.050
URL : http://doi.org/10.1016/j.disc.2008.05.050

T. Haynes, S. Pj, and . Slater, Fundamentals of domination in graphs, 1998.

C. Mynhardt, H. Swart-&-e, and . Ungerer, Excellent trees and secure domination, pp.255-267, 2005.

J. Siek, L. Lee-&-a, and . Lumsdaine, Boost graph library, 2014.