English

The Sierpi\'{n}ski Domination Number

Combinatorics 2023-09-28 v1

Abstract

Let GG and HH be graphs and let f ⁣:V(G)V(H)f \colon V(G)\rightarrow V(H) be a function. The Sierpi\'{n}ski product of GG and HH with respect to ff, denoted by GfHG \otimes _f H, is defined as the graph on the vertex set V(G)×V(H)V(G)\times V(H), consisting of V(G)|V(G)| copies of HH; for every edge gggg' of GG there is an edge between copies gHgH and gHg'H of HH associated with the vertices gg and gg' of GG, respectively, of the form (g,f(g))(g,f(g))(g,f(g'))(g',f(g)). In this paper, we define the Sierpi\'{n}ski domination number as the minimum of γ(GfH)\gamma(G\otimes _f H) over all functions f ⁣:V(G)V(H)f \colon V(G)\rightarrow V(H). 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}
}
R2 v1 2026-06-28T12:33:24.328Z