The restrained double Roman domination in graphs

DOI10.1007/s40840-022-01408-8OpenAlexW4309713931MaRDI QIDQ2683144

Changqing Xi, Jun Yue

Publication date: 3 February 2023

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01408-8

zbMATH Keywords

linear time algorithmdominationdouble Roman dominationrestrained double Roman domination number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Restrained {2}-domination in graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Weighted restrained domination in subclasses of planar graphs
• Double Roman domination
• A survey of selected recent results on total domination in graphs
• Complement reducible graphs
• Restrained domination in graphs
• Some progress on the double Roman domination in graphs
• Double Roman domination in trees
• The secure domination problem in cographs
• Double Roman domination number
• On the outer independent double Roman domination number
• The annihilation number does not bound the 2-domination number from the above
• On the independent double Roman domination in graphs
• The \(k\)-power domination problem in weighted trees
• Perfect Roman domination in graphs
• On the double Roman domination of graphs
• Perfect Italian domination in cographs
• A Linear Recognition Algorithm for Cographs
• Domination in Graphs Applied to Electric Power Networks
• Restrained double Roman domination of a graph

This page was built for publication: The restrained double Roman domination in graphs