Roman \(k\)-domination: hardness, approximation and parameterized results

DOI10.1007/978-3-031-27051-2_29MaRDI QIDQ6091177

Arusamy Mohanapriya, N. Sadagopan, P. Renjith

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

zbMATH Keywords

bipartite graphssplit graphsRoman \(k\)-dominating function

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Double Roman domination
• Roman domination on strongly chordal graphs
• Hardness results of global Roman domination in graphs
• Rainbow domination in graphs
• Roman domination in graphs.
• Algorithmic aspects of Roman domination in graphs
• On the double Roman domination in graphs
• A threshold of ln n for approximating set cover
• ROMAN k-DOMINATION IN GRAPHS
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Roman \(k\)-domination: hardness, approximation and parameterized results