Secure Paired Domination in Graphs
Jian Kang, C.M. Mynhardt, S. Arumugam · AKCE International Journal of Graphs and Combinatorics · 2014
We introduce a new strategy of domination, namely secure paired domination, which combines the advantages of both secure domination and paired domination. We propose different definitions of this concept and compare the definitions pairwise, obtaining properties of and inequalities between the secure paired domination numbers associated with the definitions. We determine the secure paired domination numbers of some classes of graphs, bound these parameters in terms of other domination-type parameters, and discuss extremal graphs for some of these bounds.We conclude by revisiting the different definitions of secure dominating sets to narrow down the field of study to two particular definitions that we believe are worthy of further investigation.