Secure paired domination in graphs
Motivated by the concepts of secure domination and paired domination, secure paired domination is introduced. It is not clear which secure paired domination concept would be most appropriate, hence, the authors propose nine different variations and make an extensive study of them. All but one of these concepts are well-defined for all isolate-free graphs. The corresponding invariants are compared pairwise and are determined for some classes of graphs. In the conclusion, the authors propose two of the nine variations that they find most suitable for further study.
scientific article; zbMATH DE number 6404144