Domination in the Sierpiński graphs S(K_n,t)

2020/08/22 by Chia-An Liu, Liu, Chia-An
Computer Science · Mathematics · #05C69 #05C76 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2008.09807

openalex publication_date 2020/08/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Different types of domination on the Sierpiński graphs S(K_n,t) will be studied in this paper. More precisely, we propose a minimal dominating set for S(K_n,t) so that the exact values of their domination numbers, Roman domination numbers, and double Roman domination numbers are given. As applications, some previous bounds and results are confirmed to be tight and further generalized.

Citations

• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Defend the Roman Empire!

Related

• On the Double Roman Domination Number of Generalized Sierpinski Graphs
• On the Roman domination number of generalized Sierpinski graphs
• The Sierpiński Domination Number
• Italian Domination and Perfect Italian Domination on Sierpinski Graphs
• On Roman, Global and Restrained Domination in Graphs