Secure paired domination in graphs
type: Item
instance of: scholarly article
title: Secure paired domination in graphs
zbMATH Open document ID: 1309.05135
author: Jian Kang
author: Christina M. Mynhardt
published in: AKCE International Journal of Graphs and Combinatorics
publication date: 2015-02-16T00:00:00Z
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.
reviewed by: Sandi Klavžar
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6404144
zbMATH Keywords: secure domination
zbMATH Keywords: paired domination
zbMATH Keywords: secure paired domination
MaRDI profile type: MaRDI publication profile
description: scientific article; zbMATH DE number 6404144