Work

On outer-independent fair Roman domination in graphs

Year: 2026
Type: article
Abstract: Let 𝐺 be an undirected graph and let 𝜌 :𝑉⁑(𝐺) β†’{0,1,2} be a Roman dominating function (RDF) on 𝐺. For each 𝑖 ∈{0,1,2}, let 𝑉𝑖 ={π‘₯ βˆˆπ‘‰β‘(𝐺) :𝜌⁑(π‘₯) =𝑖}. Then we represent 𝜌 as 𝜌 =(𝑉0,𝑉1,𝑉2). A function 𝜌 is an outer-independent fair Roman dominating function (OiFRDF) on 𝐺 if, for every 𝑣 βˆˆπ‘‰0, there exists 𝑒 βˆˆπ‘‰2 such that 𝑑𝐺⁑(𝑒,𝑣) =1, and for every π‘₯,𝑦 βˆˆπ‘‰0, |𝑁𝐺⁑(π‘₯) βˆ©π‘‰2| =|𝑁𝐺⁑(𝑦) βˆ©π‘‰2| >0, and 𝑉0 is an independent vertex set on 𝐺. The weight of OiFRDF 𝜌 is denoted by Μƒ πœ” 𝑖⁒𝐹⁑𝑅 𝐺⁑(𝜌), and is defined as Μƒ πœ” 𝑖⁒𝐹⁑𝑅 𝐺⁑(𝜌) =βˆ‘π‘§βˆˆπ‘‰β‘(𝐺)𝜌⁑(𝑧). The minimum weight of an OiFRDF 𝜌 is denoted by Μƒ 𝛾 𝑖⁒𝐹⁑𝑅⁑(𝐺) and is called the outer-independent fair Roman domination number, and is defined as Μƒ 𝛾 𝑖⁒𝐹⁑𝑅⁑(𝐺) =min⁑{ Μƒ πœ” 𝑖⁒𝐹⁑𝑅 𝐺⁑(𝜌) :𝜌 isanOiFRDFon 𝐺}. Every OiFRDF 𝜌 satisfying the condition Μƒ πœ” 𝑖⁒𝐹⁑𝑅 𝐺⁑(𝜌) = Μƒ 𝛾 𝑖⁒𝐹⁑𝑅⁑(𝐺) is called a Μƒ 𝛾 𝑖⁒𝐹⁑𝑅-function on 𝐺. 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.
Language: English
Open Access status: hybrid
OpenAlex ID: W7236436328
FWCI:
Cites: 14
Cited by:
Related to: 10