Construction of Trees With Unique Minimum Semipaired Dominating Sets

Autor: Haynes, Teresa W., Henning, Michael A.
Předmět:
Zdroj: ETSU Faculty Works.
Druh dokumentu: Text
Popis: 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.
Databáze: Networked Digital Library of Theses & Dissertations