Hardness and algorithmic results for Roman \{3\}-domination

DOI10.1007/978-3-032-17156-6_33MaRDI QIDQ7307344zbMATH OpenFDO

Authors Sangam Balchandar Reddy

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-17156-6_33

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms in computer science (68Wxx)

Cites work

• (Independent) Roman domination parameterized by distance to cluster
• Algorithmic aspects of Roman \(\{3\}\)-domination in graphs
• Algorithmic results on double Roman domination in graphs
• Double Roman domination
• Double Roman domination in trees
• Efficient algorithms for Roman domination on some classes of graphs
• Hardness and approximation results of Roman \{3\}-domination in graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• New complexity results on Roman {2}-domination
• On the algorithmic complexity of Roman \(\{2\}\)-domination (Italian domination)
• On the double Roman domination in graphs
• On the double Roman domination of graphs
• Parameterized algorithms
• Roman \(\{ 3 \}\)-domination (double Italian domination)
• Roman \(\{2 \}\)-domination
• Roman \(\{2\}\)-domination problem in graphs
• Roman \(\{3\}\)-domination in graphs: complexity and algorithms
• Roman \(k\)-domination: hardness, approximation and parameterized results
• Roman domination in graphs.
• Roman domination on strongly chordal graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• The weighted perfect domination problem and its variants

This page was built for publication: Hardness and algorithmic results for Roman \{3\}-domination

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