Minimal 2-point set dominating sets of a graph
A set is a 2-point set dominating set (2-psd set) of a graph if for any subset , there exists a non-empty subset containing at most two vertices such that the induced subgraph is connected. In this paper we characterize minimal 2-psd sets for a general graph. Based on the structure we examine 2-psd...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-08-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.03.008 |