English

A Vizing-type result for semi-total domination

Combinatorics 2021-11-15 v1

Abstract

A set of vertices SS in a simple isolate-free graph GG is a semi-total dominating set of GG if it is a dominating set of GG and every vertex of SS is within distance 2 or less with another vertex of SS. The semi-total domination number of GG, denoted by γt2(G)\gamma_{t2}(G), is the minimum cardinality of a semi-total dominating set of GG. In this paper, we study semi-total domination of Cartesian products of graphs. Our main result establishes that for any graphs GG and HH, γt2(GH)13γt2(G)γt2(H)\gamma_{t2}(G\,\square\, H)\ge \frac{1}{3}\gamma_{t2}(G)\gamma_{t2}(H).

Keywords

Cite

@article{arxiv.1803.04746,
  title  = {A Vizing-type result for semi-total domination},
  author = {John Asplund and Randy Davila and Elliot Krop},
  journal= {arXiv preprint arXiv:1803.04746},
  year   = {2021}
}

Comments

9 pages

R2 v1 2026-06-23T00:51:23.238Z