Restrained condition on double Roman dominating functions

DOI10.1016/j.amc.2022.127554OpenAlexW3201309451MaRDI QIDQ2096308

Mustapha Chellali, Doost Ali Mojdeh, Seyyed Mahmoud Sheikholeslami, Hossein Abdollahzadeh Ahangar, J. Carlos Valenzuela-Tripodoro, Babak Samadi, Nasrin Soltankhah

Publication date: 16 November 2022

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

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

zbMATH Keywords

treeNP-hardplanar graphdomination numberRoman dominationrestrained domination numberbounded clique-width graphrestrained double Roman domination

Mathematics Subject Classification ID

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

Related Items (2)

RESTRAINED ROMAN REINFORCEMENT NUMBER IN GRAPHS ⋮ Restrained {2}-domination in graphs

Cites Work

• Unnamed Item
• Double Roman domination
• Efficient algorithms for Roman domination on some classes of graphs
• Restrained domination in graphs
• Roman domination in graphs.
• Linear time solvable optimization problems on graphs of bounded clique-width
• Some progress on the restrained Roman domination
• On the outer independent double Roman domination number
• Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
• Outer independent double Roman domination
• On the double Roman domination of graphs
• Trees with equal domination and restrained domination numbers
• Outer independent Roman dominating functions in graphs
• Algorithms for Vertex Partitioning Problems on Partial k-Trees
• Restrained double Roman domination of a graph
• Bounds on the restrained Roman domination number of a graph
• Claw-free graphs with equal 2-domination and domination numbers

This page was built for publication: Restrained condition on double Roman dominating functions