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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

On outer-independent fair Roman domination in graphs

Leomarich Fortugaliza Casinillo
Annals of Communications in Mathematics
Advanced Graph Theory Research
article

On outer-independent fair Roman domination in graphs

Leomarich Fortugaliza Casinillo
article en

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.

Annals of Communications in MathematicsVol. 9(4)
Visayas State University (PH)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon