---
title: Roman Domination Number in Graph Theory
url: https://www.emergentmind.com/topics/roman-domination-number
type: topic
---

# Roman Domination Number in Graph Theory

A Roman dominating function (RDF) on a graph \(G=(V,E)\) is a labeling \(f:V\to\{0,1,2\}\) such that every vertex \(v\) with \(f(v)=0\) is adjacent to at least one vertex \(u\) with \(f(u)=2\). The Roman domination number \(\gamma_R(G)\) is the minimum total weight \(\sum_{v\in V}f(v)\) over all RDFs on \(G\). This invariant refines the classical domination number by encoding an assignment reminiscent of the strategic allocation of resources under constraints—motivated historically by the “Roman Empire defense” scenario—and admits a sharp interplay with combinatorial graph structure. Roman domination is central in extremal graph theory, product graph analysis, algebraic graph theory, and the study of graph criticality, with explicit parameterizations and classifications in broad graph families.

## 1. Formal Definition and Fundamental Properties

Let \(G=(V,E)\) be a finite simple graph. An RDF is a function \(f:V\to\{0,1,2\}\) such that every vertex \(v\) with \(f(v)=0\) has at least one neighbor \(u\) with \(f(u)=2\). The weight of \(f\) is \(w(f)=\sum_{v\in V} f(v) = |V_1|+2|V_2|\) where \(V_i=\{v\in V: f(v)=i\}\). The Roman domination number is defined as
\[
\gamma_R(G) = \min\{w(f): f\text{ is an RDF on }G\}.
\]
Fundamental inequalities include:
\[
\gamma(G) \leq \gamma_R(G) \leq 2\gamma(G),
\]
where \(\gamma(G)\) is the minimum dominating set size [2105.10006], [1605.06918], [1407.3363], [1103.2419], [2512.22622], [2412.07510]. For any nontrivial graph \(|V(G)|>1\), \(\gamma_R(G)\geq2\). In classic families, the following explicit values hold:
- For \(K_n\), \(\gamma_R(K_n)=2\) for \(n\geq2\).
- For paths \(P_n\) and cycles \(C_n\), \(\gamma_R(P_n)=\gamma_R(C_n)=\lceil2n/3\rceil\) [1407.3363], [1709.05052].

In weighted graphs, the weighted Roman domination number \(\gamma_{wR}(G)\) generalizes to cost functions \(\omega_w(f)=\sum_v f(v)w(v)\), with analogous bounds and explicit formulas for standard families [2512.22622].

## 2. Characterizations, Bounds, and Structural Results

RDFs induce natural partitions and structural restrictions:
- Any RDF partitions \(V\) into \(V_0, V_1, V_2\).
- In a minimum RDF, the subgraph induced by \(V_1\) has maximum degree at most one, there are no edges from \(V_1\) to \(V_2\), and \(V_0\cup V_2\) forms a vertex cover if the graph has no isolated vertices [1709.05052].
- If \(G\) is edgeless, \(\gamma_R(G)=\gamma(G)\).

Criticality is studied through vertex-critical graphs (v-critical): \(G\) is v-critical if \(\gamma_R(G)=|V|\) and \(\gamma_R(G-v)=|V|-1\) for all \(v\). A similar notion applies to edge-critical graphs and Roman saturated graphs, where adding certain edges or removing vertices/edges consistently impacts \(\gamma_R\) by exactly one [1311.4476], [1709.05052].

## 3. Exact Values and Extremal Graph Classes

### Cycles and Paths

The number is completely classified for paths and cycles:
\[
\gamma_R(P_n) = \left\lceil\frac{2n}{3}\right\rceil, \qquad \gamma_R(C_n) = \left\lceil\frac{2n}{3}\right\rceil.
\]
On cycles, criticality matches residue classes modulo 3; \(C_n\) is vertex-critical for \(n\equiv1,2 \pmod3\) [1311.4476].

### Roman Domination in Graph Products

For direct (tensor) products \(G\times H\):
\[
\max\{\rho(G)\gamma_R(H),\; \rho(H)\gamma_R(G)\} \leq \gamma_R(G\times H)\leq \min\{2\gamma_t(G)\gamma_{tR}(H),\; 2\gamma_t(H)\gamma_{tR}(G)\},
\]
where \(\rho\) is the packing number, \(\gamma_t\) the total domination number, and \(\gamma_{tR}\) the total Roman domination number [2105.10006].

For rooted products \(G\circ H\), only three possible values:
\[
\gamma_R(G\circ H) \in \{ n\gamma_R(H),\; \gamma_R(G) + n(\gamma_R(H)-1),\; \gamma(G) + n(\gamma_R(H)-1) \}
\]
with precise structural characterizations for each case depending on the change in \(\gamma_R(H)\) upon root removal [2105.10006].

### Sierpiński Graphs

For the generalized Sierpiński graphs \(S(G,t)\):
\[
\gamma_R(S(G,t)) \leq n^{t-2}(n\gamma_R(G) - |B_2| - |D_{1,2}| - \theta + |D_1|),
\]
with explicit evaluations for paths, cycles, and graphs with a universal vertex, as well as tightness in certain cases [1605.06918].

### Generalized Petersen Graphs

For \(P(n,2)\), \(\gamma_R(P(n,2)) = \left\lceil\frac{8n}{7}\right\rceil\), based on a repeating structure with block period 7 and local accounting arguments [1103.2419].

### Zero-Divisor Graphs and Total Graphs

For commutative ring zero-divisor graphs \(\Gamma(R)\):
- If \(R\) is a local ring, \(\gamma_R(\Gamma(R))=2\).
- If \(R=\prod_{i=1}^n R_i\), each \(R_i\) a domain, \(\gamma_R(\Gamma(R))=2n\).
- For the total graph \(T(\Gamma(R))\), bounds \(3\leq\gamma_R(T(\Gamma(R)))\leq2|R/Z(R)|\) apply [2412.07510].

## 4. Roman Domination Under Graph Operations and Perturbations

The Roman domination number's behavior under graph modifications is systematized:
- Removal of a vertex \(v\) lowers \(\gamma_R(G)\) by 1 if and only if \(v\) receives label 1 in some optimum RDF. If in every minimum RDF \(v\) has label 2, \(\gamma_R(G-v)>\gamma_R(G)\) [1709.05052].
- Addition of edges, or deletion of edges, yields tight bounds or sharply characterized "critical" and "unchanging" Roman domination classes; forests of stars and double-stars provide prototypical examples for each regime [1709.05052].
- Structural Venn diagrams relate all six main classes (vertex-reducing, vertex-unchanging, edge-reducing, etc.) with explicit inclusion and intersection properties.

## 5. Extensions: Weighted and \(k\)-Tuple Roman Domination

Weighted Roman domination generalizes to graphs with positive vertex weights \(w:V\to\mathbb{R}^+\), seeking a minimum total cost \(\sum_v f(v)w(v)\). For weighted graphs,
\[
\gamma_w(G) \leq \gamma_{wR}(G) \leq 2\gamma_w(G), \qquad \gamma_{wR}(G) = w(G) - \partial(G)
\]
where \(\partial(G)\) is the (weighted) differential [2512.22622]. Exact values are given for \(K_n\), \(K_{s,t}\), and cycles.

The Roman \(k\)-tuple domination number \(\gamma_{kR}(G)\) requires each 0-labeled vertex to have at least \(k\) neighbors with label 2, interpolating between classical and more redundant domination scenarios. For \(k=1\), one recovers the classical Roman domination number [1407.3363].

## 6. Applications, Algorithmic Complexity, and Open Problems

- Roman domination is NP-hard to compute even in unweighted graphs; the weighted problem retains this complexity [2512.22622].
- Explicit constructions and block or recursive methods yield tight values in highly symmetric or product graphs [1103.2419], [1605.06918], [2105.10006].
- Classification problems include determining all graphs with a given Roman domination number, all trees that are \(\gamma_R\)-excellent (for each vertex, there exists a minimum RDF avoiding label 0 at that vertex) [1610.00297], and understanding Roman criticality (the effect of specific edge or vertex changes) [1311.4476].
- For product graphs, a complete classification of which of the three values for \(\gamma_R(G\circ H)\) occurs, in terms of the so-called "Roman-criticality" of vertices/roots, is an open direction [2105.10006].

Roman domination parameters provide a powerful lens for probing redundancy, resilience, and allocation strategies in combinatorial, algebraic, and algorithmic settings, with a mature set of extremal results and open links to more general \(k\)-domination and weighted invariants.

Source: https://www.emergentmind.com/topics/roman-domination-number