The weight of an STRk k DF f f is ∑u∈V(G)f(u), ∑ u ∈ V ( G ) f ( u ) , and the minimum weight of an STRk k DF is the signed total Roman k k -domination number γ ...

In this paper, we continue the study of the signed total double Roman domination in graphs and present some sharp bounds for this parameter.

In this paper, we continue the study of the signed total Roman k-domination number of graphs and we present some sharp bounds for signed total Roman 2-.

A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i).

Jul 4, 2020 · In this paper we study the signed total double Roman domination and present some sharp bounds for this parameter in general graphs. In addition, ...

In this section we present some sharp bounds on the signed total double Roman domination number in graphs. Theorem 8. For any graph G of order n ≥ 2 ...

A signed total Roman k-dominating function (STRkDF) on a graph G is a function f : V (G) →{−1, 1, 2} such that (i) ... such that f ≥ 1 and k ≥ 1.

In this paper, we investigate the properties of the quadruple Roman domination number of graphs, present bounds on [Formula: see text] and give exact values for ...

Feb 12, 2024 · A total Roman \{2\}-dominating function (TR2DF) is an R2F f such that the set of vertices with f(v)>0 induce a subgraph with no isolated vertices.

May 13, 2024 · In this section we present some sharp bounds on the signed total double Roman domination number in graphs. Theorem 8. For any graph G of order n ...