Algorithm and hardness results in double Roman domination of graphs

DOI10.1016/j.tcs.2022.02.006OpenAlexW4213230130MaRDI QIDQ2118874

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)

Related Items (1)

Unique response Roman domination: complexity and algorithms

Cites Work

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

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