Algorithm and hardness results in double Roman domination of graphs

DOI10.1016/J.TCS.2022.02.006OpenAlexW4213230130MaRDI QIDQ2118874FDOQ2118874

Authors: Abolfazl Poureidi 

Publication date: 23 March 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.02.006

zbMATH Keywords

algorithminterval graphdouble Roman dominating function

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Roman domination on strongly chordal graphs
• Double Roman domination
• A unified approach to domination problems on interval graphs
• Some progress on the double Roman domination in graphs
• Double Roman domination in trees
• On the double Roman domination of graphs
• On the double Roman domination in graphs
• Varieties of Roman domination II
• On algorithmic complexity of double Roman domination
• Algorithmic results on double Roman domination in graphs

Cited In (3)

• Hardness results of global Roman domination in graphs
• Solving the minimum-cost double Roman domination problem
• Unique response Roman domination: complexity and algorithms

This page was built for publication: Algorithm and hardness results in double Roman domination of graphs

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