A note on Roman domination in graphs

DOI10.1016/J.DISC.2006.06.018zbMath1108.05072OpenAlexW2012379512MaRDI QIDQ856892

Hua-Ming Xing, Xin Chen, Xue-gang Chen

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.018

zbMATH Keywords

domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (14)

Computing Roman domatic number of graphs ⋮ A note on Roman domination of digraphs ⋮ Roman domination on strongly chordal graphs ⋮ Exact algorithms for weak Roman domination ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Total Roman domination on the digraphs ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Global Roman domination in graphs ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Note on 2-rainbow domination and Roman domination in graphs ⋮ Roman Domination in Graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Unnamed Item ⋮ Upper bounds on Roman domination numbers of graphs

Cites Work

• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Unnamed Item

This page was built for publication: A note on Roman domination in graphs