The double Roman domination number of generalized Sierpiński graphs

DOI10.1142/S1793830920500470zbMath1457.05073arXiv1908.06858OpenAlexW3043729534MaRDI QIDQ5858154

V. Anu, S. Aparna Lakshmanan

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.06858

zbMATH Keywords

Sierpiński graphsdouble Roman domination numberdouble Roman dominating function

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (7)

Italian domination and perfect Italian domination on Sierpiński graphs ⋮ γ-induced-paired dominating graphs of paths and cycles ⋮ Outer independent double Italian domination: Complexity, characterization ⋮ New results on quadruple Roman domination in graphs ⋮ Inverse double Roman domination in graphs ⋮ Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) ⋮ Italian domination on Mycielskian and Sierpinski graphs

Cites Work

• Double Roman domination
• Double Roman domination number
• Double Roman domination in digraphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Double Roman domination and domatic numbers of graphs
• 1-perfect codes in Sierpiński graphs
• On the roman domination number of generalized Sierpiński graphs
• Total Roman domination in graphs
• An upper bound on the double Roman domination number

This page was built for publication: The double Roman domination number of generalized Sierpiński graphs