Title

Construction of Trees With Unique Minimum Semipaired Dominating Sets

Document Type

Article

Publication Date

2-1-2021

Description

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.

This document is currently not available here.

Share

COinS