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.
Identifer | oai:union.ndltd.org:ETSU/oai:dc.etsu.edu:etsu-works-10898 |
Date | 01 February 2021 |
Creators | Haynes, Teresa W., Henning, Michael A. |
Publisher | Digital Commons @ East Tennessee State University |
Source Sets | East Tennessee State University |
Detected Language | English |
Type | text |
Source | ETSU Faculty Works |
Page generated in 0.0018 seconds