A Vizing-type result for semi-total domination
Abstract
A set of vertices S in a simple isolate-free graph G is a semi-total dominating set of G if it is a dominating set of G and every vertex of S is within distance 2 or less with another vertex of S. The semi-total domination number of G, denoted by γt2(G), is the minimum cardinality of a semi-total dominating set of G. In this paper, we study semi-total domination of Cartesian products of graphs. Our main result establishes that for any graphs G and H, γt2(G\,\, H) 13γt2(G)γt2(H).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.