Italian domination and perfect Italian domination on Sierpiński graphs

DOI10.1080/09720529.2021.1933705zbMath1483.05127arXiv2009.09202OpenAlexW3176927426MaRDI QIDQ5035034

V. Anu, S. Aparna Lakshmanan, Jismy Varghese

Publication date: 21 February 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

Sierpiński graphItalian dominationperfect Italian domination

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 (2)

Perfect Italian domination in graphs: complexity and algorithms ⋮ Approximation algorithm for (connected) Italian dominating function

Cites Work

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Italian domination in trees
• A survey and classification of Sierpiński-type graphs
• Perfect Italian domination in trees
• Perfect Italian domination on planar and regular graphs
• Graphs with large Italian domination number
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 1-perfect codes in Sierpiński graphs
• Italian domination on Mycielskian and Sierpinski graphs
• On the roman domination number of generalized Sierpiński graphs
• Irregularity of Sierpinski graph
• The double Roman domination number of generalized Sierpiński graphs

This page was built for publication: Italian domination and perfect Italian domination on Sierpiński graphs