Italian domination on Mycielskian and Sierpinski graphs

DOI10.1142/S1793830921500373zbMath1475.05145OpenAlexW3105157801MaRDI QIDQ5013489

S. Aparna Lakshmanan, Jismy Varghese

Publication date: 30 November 2021

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

Full work available at URL: https://doi.org/10.1142/s1793830921500373

zbMATH Keywords

Mycielskian graphItalian dominationSierpinski graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Italian domination and perfect Italian domination on Sierpiński graphs ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ Resolvability and convexity properties in the Sierpiński product of graphs ⋮ On the Roman {2}-domatic number of graphs

Cites Work

• Unnamed Item
• Roman \(\{2 \}\)-domination
• New results on variants of covering codes in Sierpiński graphs
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• 1-perfect codes in Sierpiński graphs
• The double Roman domination number of generalized Sierpiński graphs

This page was built for publication: Italian domination on Mycielskian and Sierpinski graphs