On the Roman domination number of a graph

DOI10.1016/J.DISC.2008.09.043zbMath1191.05071OpenAlexW2028111792MaRDI QIDQ1025980

Hossein Karami, Rana Khoeilar, Seyyed Mahmoud Sheikholeslami, Odile Favaron

Publication date: 23 June 2009

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

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

zbMATH Keywords

Roman domination number

Mathematics Subject Classification ID

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

Related Items (47)

A note on the Roman domatic number of a digraph ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Lower and upper bounds on independent double Roman domination in trees ⋮ A note on the bounds of Roman domination numbers ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ On the strong Roman domination number of graphs ⋮ Independent Roman domination and 2-independence in trees ⋮ Complexity aspects of variants of independent Roman domination in graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ Roman domination in direct product graphs and rooted product graphs ⋮ Exact algorithms for weak Roman domination ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Algorithmic aspects of outer independent Roman domination in graphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Unnamed Item ⋮ Weak \(\{2\}\)-domination number of Cartesian products of cycles ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Global Roman domination in graphs ⋮ On the global Roman domination number in graphs ⋮ Independent double Roman domination in graphs ⋮ On the co-Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic Aspects of Quasi-Total Roman Domination in Graphs ⋮ Independent roman $\{3\}$-domination ⋮ ON THE ROMAN BONDAGE NUMBER OF A GRAPH ⋮ Note on 2-rainbow domination and Roman domination in graphs ⋮ Mixed Roman domination and 2-independence in trees ⋮ Critical graphs with Roman domination number four ⋮ Roman Domination in Graphs ⋮ Algorithmic aspects of Roman domination in graphs ⋮ Independent double Roman domination in graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Total Roman reinforcement in graphs ⋮ Unnamed Item ⋮ Total Roman domatic number of a graph ⋮ Bounds on the co-Roman domination number in graphs ⋮ Properties of double Roman domination on cardinal products of graphs ⋮ Perfect double Roman domination of trees ⋮ Constructive characterizations concerning weak Roman domination in trees ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ On roman domination number of functigraph and its complement ⋮ Extremal digraphs for an upper bound on the Roman domination number ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ Isolate Roman domination in graphs ⋮ Algorithmic aspects of total Roman {3}-domination in graphs ⋮ Global double Roman domination in graphs

Cites Work

• Unnamed Item
• On graphs having domination number half their order
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Domination in graphs with minimum degree two
• Extremal Problems for Roman Domination

This page was built for publication: On the Roman domination number of a graph