Computing Roman domatic number of graphs

DOI10.1016/J.IPL.2016.04.010MaRDI QIDQ284340zbMATH OpenOpenAlexFDO

Authors Haisheng Tan, Hongyu Liang, Jipeng Zhou, Rui Wang

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

graphcomputational complexityapproximation 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) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On the Roman domination number of a graph
• Total Roman domatic number of a graph
• The roman k-domatic number of a graph
• The roman domatic number of a graph
• The Roman \(\{2 \}\)-domatic number of graphs
• The Roman \((k, k)\)-domatic number of a graph
• scientific article; zbMATH DE number 7478592
• On the total Roman domination number of graphs.
• On the Roman \(\{2\}\)-domatic number of graphs
• Algorithmic aspects of Roman graphs

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330032 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• A note on Roman domination in graphs
• Approximating theDomatic Number
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Efficient algorithms for Roman domination on some classes of graphs
• Extremal problems for roman domination
• Graph theory
• Roman domination in graphs.
• Roman domination in regular graphs
• Roman domination on strongly chordal graphs
• Signed Roman domination in graphs
• Signed Roman edge domination numbers in graphs
• The roman domatic number of a graph
• Towards a theory of domination in graphs
• Unique response Roman domination in graphs
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number

Cited in

(4)

• The Roman domatic problem in graphs and digraphs: a survey
• The distance Roman domatic number of a graph
• Domination-related parameters in middle graphs
• Roman domination in graphs

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

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