期刊名称：AKCE International Journal of Graphs and Combinatorics
印刷版ISSN：0972-8600
出版年度：2017
卷号：14
期号：2
页码：135-141
DOI：10.1016/j.akcej.2017.03.008
语种：English
出版社：Elsevier
摘要：Abstract A set D ⊆ V ( G ) is a 2-point set dominating set (2-psd set) of a graph G if for any subset S ⊆ V − D , there exists a non-empty subset T ⊆ D containing at most two vertices such that the induced subgraph 〈 S ∪ T 〉 is connected. In this paper we characterize minimal 2-psd sets for a general graph. Based on the structure we examine 2-psd sets in a separable graph and discuss the criterion for a 2-psd set to be minimal.
关键词：Keywords2-Point set dominationPoint set dominationDomination
