Abstract
Let G be a graph with vertex set V and no isolated vertices. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distance two apart. We present a method of building trees having a unique minimum semipaired dominating set.
Original language | English |
---|---|
Pages (from-to) | 1-12 |
Number of pages | 12 |
Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |
Volume | 116 |
Publication status | Published - Feb 2021 |
Keywords
- Paired-domination
- Semipaired domination number
ASJC Scopus subject areas
- General Mathematics