Construction of trees with unique minimum semipaired dominating sets

Teresa W. Haynes, Michael A. Henning

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)1-12
Number of pages12
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Publication statusPublished - Feb 2021


  • Paired-domination
  • Semipaired domination number

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Construction of trees with unique minimum semipaired dominating sets'. Together they form a unique fingerprint.

Cite this