Outer independent double Italian domination: Complexity, characterization

DOI10.1142/S1793830922500859MaRDI QIDQ6132230zbMATH OpenOpenAlexFDO

Authors Doost Ali Mojdeh

Publication date 14 July 2023

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

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

zbMATH Keywords

complexitycharacterizationItalian domination number(outer independent) double Italian domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Remarks on the outer-independent double Italian domination number
• Bounds on the outer-independent double Italian domination number
• On the outer independent double Roman domination number
• Outer Independent Double Italian Domination of Some Graph Products

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear algorithm for double Roman domination of proper interval graphs
• Algorithmic aspects of total Roman \(\{3\}\)-domination in graphs
• Bounds on the double Italian domination number of a graph
• Bounds on the outer-independent double Italian domination number
• Covering Italian domination in graphs
• Critical concept for double Roman domination in graphs
• Double Roman domination
• Double Roman domination in trees
• Double Roman domination number
• Italian domination in trees
• New and improved results on the signed (total) k-domination number of graphs
• On the domination number of a graph and its shadow graph
• On the independent double Roman domination in graphs
• On the outer independent double Roman domination number
• Outer-independent total Roman domination in graphs
• Perfect Italian domination in trees
• Restrained geodetic domination in graphs
• Roman \(\{ 3 \}\)-domination (double Italian domination)
• Roman \(\{2 \}\)-domination
• Roman domination in graphs.
• Some progress on the double Roman domination in graphs
• The double Roman domination number of generalized Sierpiński graphs
• Total double Roman domination in graphs

Cited in

(8)

• On the outer independent double Roman domination number
• New bounds on the outer-independent total double Roman domination number
• Remarks on the outer-independent double Italian domination number
• On the outer-independent double Italian domination number
• On the (total) restrained double Italian domination of central of graphs
• On the total restrained double Italian domination
• Outer Independent Double Italian Domination of Some Graph Products
• Bounds on the outer-independent double Italian domination number

This page was built for publication: Outer independent double Italian domination: Complexity, characterization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132230)