The Sierpi\'{n}ski Domination Number
Abstract
Let and be graphs and let be a function. The Sierpi\'{n}ski product of and with respect to , denoted by , is defined as the graph on the vertex set , consisting of copies of ; for every edge of there is an edge between copies and of associated with the vertices and of , respectively, of the form . In this paper, we define the Sierpi\'{n}ski domination number as the minimum of over all functions . The upper Sierpi\'{n}ski domination number is defined analogously as the corresponding maximum. After establishing general upper and lower bounds, we determine the upper Sierpi\'{n}ski domination number of the Sierpi\'{n}ski product of two cycles, and determine the lower Sierpi\'{n}ski domination number of the Sierpi\'{n}ski product of two cycles in half of the cases and in the other half cases restrict it to two values.
Cite
@article{arxiv.2309.15409,
title = {The Sierpi\'{n}ski Domination Number},
author = {Michael A. Henning and Sandi Klavžar and Elżbieta Kleszcz and Monika Pilśniak},
journal= {arXiv preprint arXiv:2309.15409},
year = {2023}
}