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.
Author: Leomarich F. Casinillo
Institution: Visayas State University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W7236436328
