Outer independent double Roman domination

DOI10.1016/j.amc.2019.124617zbMath1433.05241OpenAlexW2967176398MaRDI QIDQ2284046

Mustapha Chellali, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami

Publication date: 14 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.124617

zbMATH Keywords

Roman dominationdouble Roman dominationouter independent double Roman domination

Mathematics Subject Classification ID

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

Related Items (29)

A new approach on locally checkable problems ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ On the outer-independent double Italian domination number ⋮ Further progress on the total Roman \(\{2\}\)-domination number of graphs ⋮ Unnamed Item ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ On the outer independent double Roman domination number ⋮ Triple Roman domination in graphs ⋮ Perfect Italian domination in cographs ⋮ On the outer independent total double Roman domination in graphs ⋮ The total co-independent domination number of some graph operations ⋮ Total double Roman domination numbers in digraphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Further results on independent double roman trees ⋮ Disprove of a conjecture on the double Roman domination number ⋮ On [ k -Roman domination in graphs] ⋮ New results on quadruple Roman domination in graphs ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ Unnamed Item ⋮ Maximal double Roman domination in graphs ⋮ Some progress on the restrained Roman domination ⋮ Total Roman \(\{2\}\)-reinforcement of graphs ⋮ Varieties of Roman domination II ⋮ The domination number of round digraphs ⋮ Restrained condition on double Roman dominating functions ⋮ Total k-rainbow reinforcement number in graphs ⋮ Quadruple Roman domination in graphs ⋮ Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double Roman domination
• Double Roman domination in trees
• Double Roman domination number
• On the double Roman domination of graphs
• On the double Roman domination in graphs
• On the \([1,2\)-domination number of generalized Petersen graphs]
• Domination in graphs with minimum degree two
• Towards a theory of domination in graphs
• Double Roman domination and domatic numbers of graphs
• Paths, Stars and the Number Three
• An upper bound on the double Roman domination number

This page was built for publication: Outer independent double Roman domination