Roman domination in regular graphs

DOI10.1016/J.DISC.2008.03.006zbMath1183.05063OpenAlexW2071135458MaRDI QIDQ1024464

Yuansheng Yang, Fu Xueliang, Jiang Baoqi

Publication date: 17 June 2009

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

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

zbMATH Keywords

regular graphroman domination numberRoman graph

Mathematics Subject Classification ID

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

Related Items (20)

Computing Roman domatic number of graphs ⋮ A note on Roman domination of digraphs ⋮ Roman domination dot-critical graphs ⋮ Vertex-addition strategy for domination-like invariants ⋮ On the strong Roman domination number of graphs ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Unnamed Item ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ On the \(k\)-strong Roman domination problem ⋮ Global Roman domination in graphs ⋮ On the roman domination in the lexicographic product of graphs ⋮ The geodetic domination number of comb product graphs ⋮ A continuous generalization of domination-like invariants ⋮ Roman Domination in Graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ 2-rainbow domination of generalized Petersen graphs \(P(n,2)\) ⋮ Unnamed Item ⋮ Total Roman domination in digraphs ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set ⋮ On the roman domination number of generalized Sierpiński graphs

Cites Work

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

This page was built for publication: Roman domination in regular graphs