Abstract:
Let \( G \) be an undirected graph and let \( \rho : V(G) \rightarrow \{0,1,2\} \) be a Roman dominating function (RDF) on \( G \). For each \( i \in \{0,1,2\} \), let \( V_i = \{x \in V(G) : \rho(x) = i\} \). Then we represent \( \rho \) as \( \rho = (V_0,V_1,V_2) \). A function \( \rho \) is an outer-independent fair Roman dominating function (OiFRDF) on \( G \) if, for every \( v \in V_0 \), there exists \( u \in V_2 \) such that \( d_G(u,v) = 1 \), and for every \( x,y \in V_0 \), \( |N_G(x) \cap V_2| = |N_G(y) \cap V_2| > 0 \), and \( V_0 \) is an independent vertex set on \( G \). The weight of OiFRDF \( \rho \) is denoted by \( \widetilde{\omega}_G^{iFR}(\rho) \), and is defined as \( \widetilde{\omega}_G^{iFR}(\rho) = \sum_{z \in V(G)} \rho(z) \). The minimum weight of an OiFRDF \( \rho \) is denoted by \( \widetilde{\gamma}_{iFR}(G) \) and is called the outer-independent fair Roman domination number, and is defined as \( \widetilde{\gamma}_{iFR}(G) = \min\{\widetilde{\omega}_G^{iFR}(\rho) : \rho \text{ is an OiFRDF on } G\} \). Every OiFRDF \( \rho \) satisfying the condition \( \widetilde{\omega}_G^{iFR}(\rho) = \widetilde{\gamma}_{iFR}(G) \) is called a \( \widetilde{\gamma}_{iFR} \)-function on \( G \). This study introduces a new restricted version of Roman domination in graphs called the outer-independent fair Roman dominating function and discusses some graph-theoretic properties.





Open Access