Construction of Trees With Unique Minimum Semipaired Dominating Sets
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.
Haynes, Teresa W.; and Henning, Michael A.. 2021. Construction of Trees With Unique Minimum Semipaired Dominating Sets. Journal of Combinatorial Mathematics and Combinatorial Computing. Vol.116 1-12. ISSN: 0835-3026