Outer-interior Convex Roman Dominating Function in Graphs

Authors

  • Leomarich Casinillo Department of Mathematics, Visayas State University, 6521 Baybay City, Philippines

DOI:

https://doi.org/10.62071/tmjm.v8i1.887

Keywords:

Convex Roman domination, interior vertex, outer-interior convex Roman domination

Abstract

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

Similar Articles

You may also start an advanced similarity search for this article.