Secure paired domination in graphs

MaRDI QIDQ2255461zbMATH OpenFDO

Authors Jian Kang, Christina M. Mynhardt

Publication date 16 February 2015

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

paired dominationsecure dominationsecure paired domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1185309
• scientific article; zbMATH DE number 2188616
• Paired-domination in graphs
• On secure domination in graphs
• Secure domination and secure total domination in graphs

Cited in

(2)

• Secure domination in rooted product graphs
• Eternal and Secure Domination in Graphs

This page was built for publication: Secure paired domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2255461)