On outer-independent fair Roman domination in graphs
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.
Authors
- Leomarich Fortugaliza Casinillo (ORCID: https://orcid.org/0000-0003-3966-8836)
Institutions
- Visayas State University (PH)
Publication Details
- Journal
- Annals of Communications in Mathematics
- Published
- 2026-11-18
- DOI
- https://doi.org/10.62072/acm.2026.09052
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00