paper

A Vizing-type result for semi-total domination

arXiv:1803.04746 · doi:10.1016/j.dam.2018.11.023

Abstract

A set of vertices in a simple isolate-free graph is a semi-total dominating set of if it is a dominating set of and every vertex of is within distance 2 or less with another vertex of . The semi-total domination number of , denoted by , is the minimum cardinality of a semi-total dominating set of . In this paper, we study semi-total domination of Cartesian products of graphs. Our main result establishes that for any graphs and , .

9 pages