The quasi-total Roman reinforcement number r qtR ( G ) of a graph G is the minimum number of edges that have to be added to G in order to decrease the quasi- ...
The quasi-total Roman reinforcement number r 𝑞 𝑡 𝑅 ( 𝐺 ) of a graph G is the minimum number of edges that have to be added to G in order to decrease the quasi ...
Jul 30, 2024 · The quasi-total Roman reinforcement number rqtR(G) of a graph G is the minimum number of edges that have to be added to G in order to decrease ...
Semantic Scholar extracted view of "Quasi-total Roman reinforcement in graphs" by Nafiseh Ebrahimi et al.
Oct 22, 2024 · The total Roman reinforcement number rtR (G) of a graph G is the minimum number of edges that must be added to G in order to decrease the total ...
Mar 23, 2019 · We introduce the quasi-total Roman domination number of graphs in this article, and begin the study of its combinatorial and computational properties.
Missing: reinforcement | Show results with:reinforcement
The total Roman { 2 } -reinforcement number of a graph G, denoted by r t R 2 ... quasi-total strong differential to quasi-total Italian domination in graphs.
In this section, we determine the restrained Roman reinforcement number of some classes of graphs including paths, cycles and complete p-partite graphs for any ...
A restrained Roman dominating function (RRD-function) on a graph G=(V,E) is a function f from V into {0,1,2} satisfying: (i) every vertex u with f(u)=0 is ...
Oct 15, 2023 · Abstract: A quasi total double Roman dominating function (QTDRD-function) on a graph G = (V (G), E(G)) is a function f : V (G) −→ {0, 1, 2, ...