Outer-interior Convex Roman Dominating Function in Graphs
DOI:
https://doi.org/10.62071/tmjm.v8i1.887Keywords:
Convex Roman domination, interior vertex, outer-interior convex Roman dominationAbstract
Let πΊ = (π(πΊ), πΈ(πΊ)) be a connected graph and let π : π(πΊ) β {0, 1, 2} be an RDF on πΊ. For each π β {0, 1, 2}, let πβ±Ό = {π§ β π(πΊ) : π(π§) = π}. Then we write π = (πβ, πβ, πβ). A function π is an outer-interior convex Roman dominating function (OInCvRDF) on πΊ if (π) for each π£ β πβ, there exists π’ β πβ such that π’π£ β πΈ(πΊ), (ππ) πβ is an interior vertex set, and (πππ) πβ βͺ πβ is a convex set. The weight of OInCvRDF π, denoted by αΏΆGInCvR(π), is defined as αΏΆGInCvR(π) = βπ§ β π(πΊ) π(π§). The outer-interior convex Roman domination number of πΊ, denoted by Ξ³ΜInCvR(πΊ), is defined as Ξ³ΜInCvR(πΊ) = min{αΏΆGInCvR(π) : π is an OInCvRDF on πΊ}. Every OInCvRDF π on πΊ with αΏΆGInCvR(π) = Ξ³ΜInCvR(πΊ) is called a Ξ³ΜInCvR-function on πΊ. In this paper, we introduce a new restricted version of convex Roman domination in graphs, called the outer-interior convex Roman dominating function, and present some of its graph-theoretic properties.Downloads
Published
2026-05-30
Issue
Section
Articles
How to Cite
Outer-interior Convex Roman Dominating Function in Graphs. (2026). The Mindanawan Journal of Mathematics, 8(1), 21-29. https://doi.org/10.62071/tmjm.v8i1.887