Roman Domination and γR-Excellent Graphs

• Roman domination is defined by labeling vertices with 0, 1, or 2 such that every 0-labeled vertex has a neighbor labeled 2, and the minimum labeling weight defines γR(G).
• γR-excellent graphs guarantee that every vertex can appear as a defender (labeled 1 or 2) in some minimum-weight Roman dominating function, highlighting robust network defense.
• Constructive characterizations using recursive tree operations reveal that UVR properties and status partitioning are central to maintaining stability under vertex or edge modifications.

A Roman dominating function (RDF) on a simple graph $G=(V,E)$ is a labeling $f:V\to\{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ has a neighbor $u$ with $f(u)=2$. The weight of $f$ is $f(V)=\sum_{v\in V} f(v)$, and the Roman domination number $\gamma_R(G)$ is the minimum weight across all RDFs on $G$. An RDF achieving weight $f:V\to\{0,1,2\}$0 is called a $f:V\to\{0,1,2\}$1-function. A graph $f:V\to\{0,1,2\}$2 is $f:V\to\{0,1,2\}$3-excellent if for every vertex $f:V\to\{0,1,2\}$4 there exists a $f:V\to\{0,1,2\}$5-function $f:V\to\{0,1,2\}$6 with $f:V\to\{0,1,2\}$7; equivalently, every vertex is labeled $f:V\to\{0,1,2\}$8 or $f:V\to\{0,1,2\}$9 in some minimum-weight RDF. This property, and its structural manifestations in classes such as UVR (where for every vertex $v$0, $v$1 for domination number), have been thoroughly characterized for trees and related classes, revealing robust and "nice" behavior for network resilience and combinatorial structure (Samodivkin, 2016, Samodivkin, 2015, Samodivkin, 2017).

1. Roman Domination: Definitions and Fundamental Invariants

Let $v$2 be a finite simple graph. The Roman domination number $v$3 serves as a measure of minimal "reinforcement" required to defend all vertices, with labels representing defensive resources. The partition $v$4 for $v$5 provides structure for analysis. The classical domination number $v$6 is defined as the cardinality of a smallest dominating set $v$7 such that $v$8.

The Roman bondage number $v$9 is the minimum cardinality $f(v)=0$0 such that $f(v)=0$1; it quantifies the stability of $f(v)=0$2 under edge deletions. The study of these invariants on UVR graphs (those with $f(v)=0$3 for all $f(v)=0$4) yields sharp bounds and tight characterizations: Specifically, for $f(v)=0$5 connected of order $f(v)=0$6, $f(v)=0$7 with equality only for those graphs where all minimum RDFs are label-$f(v)=0$8-free, their label-$f(v)=0$9 sets form efficient dominating sets of degree 2 (Samodivkin, 2015).

2. $u$0-Excellent Graphs: Definition and Characterization

A graph $u$1 is $u$2-excellent if every vertex $u$3 admits a minimum-weight RDF $u$4 with $u$5. Equivalently, no vertex is forced to be labeled 0 in all $u$6-functions. For trees, this excellence is characterized constructively via a quartet status labeling $u$7 and a set of recursive building operations ($u$8 through $u$9) starting from five "seed" trees $f(u)=2$0 with specific labelings (Samodivkin, 2016):

• Status A: $f(u)=2$1 (vertices that can be labeled 0 or 1 in some $f(u)=2$2-function).
• Status D: $f(u)=2$3 (vertices that can be labeled 0, 1, or 2).
• Status B: vertices in $f(u)=2$4 of degree 2 with exactly one neighbor in $f(u)=2$5.
• Status C: remaining $f(u)=2$6-vertices.

A tree $f(u)=2$7 is $f(u)=2$8-excellent if and only if there is a labeling $f(u)=2$9 such that $f$0 belongs to the recursively constructed family $f$1 via these operations.

3. Constructive Characterizations and Structural Properties

For trees, UVR membership (i.e., $f$2 for all $f$3) is equivalent to

• Having a unique $f$4-function $f$5 with $f$6,
• $f$7 (label-2 vertices) forming an independent set,
• Each label-2 vertex together with its two label-0 neighbors forming a private neighborhood of size 3.

Constructive labeling uses three statuses $f$8 and a set of tree extension rules (e.g., attach 3-paths or 3-stars at special-status vertices): All UVR trees can be built from a labeled $f$9 and recursive application of four attachment operations. In these trees, every B-vertex (which will be labeled 2 in the unique RDF) has exactly two A-neighbors, and no minimum RDF uses label 1 (Samodivkin, 2015).

For $f(V)=\sum_{v\in V} f(v)$0-excellent trees, the constructive process extends via additional statuses and attachments; in particular, every UVR tree is $f(V)=\sum_{v\in V} f(v)$1-excellent, with its vertex set partitioned into status C and D only (Samodivkin, 2016). In the broader graph context, UVR graphs satisfy

• $f(V)=\sum_{v\in V} f(v)$2,
• $f(V)=\sum_{v\in V} f(v)$3,
• $f(V)=\sum_{v\in V} f(v)$4, with $f(V)=\sum_{v\in V} f(v)$5 the minimum degree.

4. Comparative Classes and Robustness

Roman domination properties admit a taxonomy based on the stability of $f(V)=\sum_{v\in V} f(v)$6 under vertex and edge modifications (Samodivkin, 2017). The principal classes for $f(V)=\sum_{v\in V} f(v)$7 changes are:

• CVR: $f(V)=\sum_{v\in V} f(v)$8 for all $f(V)=\sum_{v\in V} f(v)$9 (critical under vertex removal).
• UVR: $\gamma_R(G)$0 for all $\gamma_R(G)$1 (unchanged).
• CER/UEA: analogues for edge addition/deletion.

The intersection and containment relationships of these classes are extensive; for instance, CVR and UVR are disjoint, UVR is contained in UEA, and all graphs in UVR have label-1-free $\gamma_R(G)$2-functions. $\gamma_R(G)$3-excellent graphs generalize UVR robustness: They are resistant to reductions in Roman domination number under single-vertex deletions, as every vertex can be defended (appear with label 1 or 2) in some minimum RDF. UVR trees and their Roman domination analogues illustrate the sharp bounds and extremal resistance to perturbation: Bondage stability and unique RDFs within UVR directly transfer to the $\gamma_R(G)$4-excellent context (Samodivkin, 2016, Samodivkin, 2015).

5. Examples, Criticality, and Extremal Constructions

The following table summarizes several key examples from the literature on $\gamma_R(G)$5-excellent and UVR trees:

Graph/Tree	$\gamma_R(G)$6	$\gamma_R(G)$7-excellent?	Construction/Status
$\gamma_R(G)$8	2	Yes	Both vertices labeled 1 or 2
$\gamma_R(G)$9	2	No	Endpoints always 0
$G$0	$G$1	Yes	Efficient dominance, UVR
$G$2	$G$3	Yes	UVR, unique RDF
$G$4	3	No	$G$5 drops on deletion

The recursive construction processes enable the generation of larger $G$6-excellent trees from seed configurations: For example, starting with $G$7 (a framework of five vertices), repeated use of operations $G$8 and $G$9 produces increasingly complex $f:V\to\{0,1,2\}$00-excellent trees, always preserving the status partition and properties required. This robustness and structural predictability suggest significant applications in network reliability and defense models, where stable resource allocations are crucial under small perturbations (Samodivkin, 2016).

6. Open Problems and Research Directions

Ongoing investigations include:

• Characterizing unicyclic and more complex graphs in $f:V\to\{0,1,2\}$01.
• Determining extremal edge counts for given $f:V\to\{0,1,2\}$02 with $f:V\to\{0,1,2\}$03 in $f:V\to\{0,1,2\}$04.
• Improving the upper bound $f:V\to\{0,1,2\}$05 so that $f:V\to\{0,1,2\}$06 for connected graphs with $f:V\to\{0,1,2\}$07.
• Developing reconfiguration graphs for $f:V\to\{0,1,2\}$08 and related invariants, exploring connectivity and realizability aspects.
• Studying the strong Roman domination number $f:V\to\{0,1,2\}$09, where additional requirements yield higher values (e.g., for trees, $f:V\to\{0,1,2\}$10 with extremal constructions relying on rooted products of subdivided stars) (Alvarez-Ruiz et al., 2015).

A plausible implication is that further exploration of status-partition-based constructions and their algorithmic ramifications may yield efficient recognition and generation protocols for Roman domination-excellent and UVR graphs, relevant both in combinatorial optimization and dynamic network theory.