Computing Roman domatic number of graphs

DOI10.1016/J.IPL.2016.04.010zbMath1358.68148OpenAlexW2342567394MaRDI QIDQ284340

Jipeng Zhou, Rui Wang, Haisheng Tan, Hongyu Liang

Publication date: 18 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.04.010

zbMATH Keywords

computational complexitygraphapproximation algorithmsRoman domatic number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (2)

The Roman domatic problem in graphs and digraphs: a survey ⋮ Roman Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman domination on strongly chordal graphs
• A note on Roman domination in graphs
• The roman domatic number of a graph
• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in regular graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Roman domination in graphs.
• Unique response Roman domination in graphs
• Signed Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Extremal Problems for Roman Domination
• Towards a theory of domination in graphs
• Approximating theDomatic Number
• Signed Roman edge domination numbers in graphs

This page was built for publication: Computing Roman domatic number of graphs