The Sierpi\'nski Domination Number

Abstract

Let G and H be graphs and let f V(G)→ V(H) be a function. The Sierpi\'nski product of G and H with respect to f, denoted by G f H, is defined as the graph on the vertex set V(G)× V(H), consisting of |V(G)| copies of H; for every edge gg' of G there is an edge between copies gH and g'H of H associated with the vertices g and g' of G, respectively, of the form (g,f(g'))(g',f(g)). In this paper, we define the Sierpi\'nski domination number as the minimum of γ(G f H) over all functions f V(G)→ V(H). The upper Sierpi\'nski domination number is defined analogously as the corresponding maximum. After establishing general upper and lower bounds, we determine the upper Sierpi\'nski domination number of the Sierpi\'nski product of two cycles, and determine the lower Sierpi\'nski domination number of the Sierpi\'nski product of two cycles in half of the cases and in the other half cases restrict it to two values.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…