Algorithm and hardness results in double Roman domination of graphs

DOI10.1016/J.TCS.2022.02.006MaRDI QIDQ2118874zbMATH OpenOpenAlexFDO

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

algorithmdouble Roman dominating functioninterval graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On algorithmic complexity of double Roman domination
• Algorithmic results on double Roman domination in graphs
• Some progress on the double Roman domination in graphs
• Double Roman domination in graphs: algorithmic complexity
• On the double Roman domination in graphs

Cites work

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

Cited in

(6)

• Unique response Roman domination: complexity and algorithms
• Double Roman domination in graphs: algorithmic complexity
• Solving the minimum-cost double Roman domination problem
• The k-th Roman domination problem is polynomial on interval graphs
• On \([1,2]\)-domination in interval and circle graphs
• Hardness results of global Roman domination in graphs

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)