An Upper Bound on the Total Roman $\{2\}$-domination Number of Graphs with Minimum Degree Two

1. Introduction

In this paper, $G$ is a simple graph with vertex set $V=V(G)$ and edge set $E=E(G)$. The order $|V|$ of $G$ is denoted by $n(G)$. For every vertex $v\in V$, the open neighborhood $N(v)$ is the set $\{u\in V(G)\mid vu\in E(G)\}$ and the closed neighborhood of $v$ is the set $N[v]=N(v)\cup \{v\}$. The degree of a vertex $v\in V$ is ${\mathrm{deg}}_G(v)=|N(v)|$. The minimum and maximum degree of a graph $G$ are denoted by $\delta (G)$ and $\mathrm{\Delta }(G)$, respectively. Let $P_n$ and $C_n$ be the path and cycle of order $n$.

For a graph $G$ and a positive integer $k$, let $f:V(G)\to \{0,1,2,\dots ,k\}$ be a function, and let $(V_0,V_1,V_2,\dots ,V_k)$ be the ordered partition of $V(G)$ induced by $f$, where $V_i=\{v\in V\mid f(v)=i\}$ for $i\in \{0,1,\dots ,k\}$. There is a $1$–$1$ correspondence between the function $f:V\to \{0,1,2,\dots ,k\}$ and the ordered partitions $(V_0,V_1,V_2,\dots ,V_k)$ of $V$, so we will write $f=(V_0,V_1,V_2,\dots ,V_k)$. The weight of $f$ is the value $f(V(G))=\sum _{u\in V(G)}f(u).$

In [1], Chellali et al. investigated the Roman $\{2\}$-domination (called in [2] and elsewhere Italian domination) defined as follows: a Roman $\{2\}$-dominating function (R$\{2\}$-DF) on $G$ is a function $f=(V_0,V_1,V_2)$ with the property that for every vertex $v\in V_0$ there is a vertex $u\in N(v)$, with $u\in V_2$ or there are two vertices $x,y\in N(v)$ with $x,y\in V_1$. The Roman $\{2\}$ -domination number ${\gamma }_{R2}(G)$ is the minimum weight of an R$\{2\}$-DF on $G$. Some variant of Italian domination has been studied for example in [3, 4]. Note that, Roman domination and its variants have many applications in the areas such as facility location problems, planning of defence strategies and surveillance related problems, etc. The literature on this topic has been detailed in several papers [5, 6, 7, 8, 9, 10].

A total Roman $\{2\}$-dominating function (total Roman $\{2\}$-dominating function) is an R$\{2\}$-DF $f$ such that the set of vertices with $f(v)>0$ induces a subgraph with no isolated vertices. The weight of a total Roman $\{2\}$-dominating function is the sum of its function values over all vertices, and the minimum weight of a total Roman $\{2\}$-dominating function of $G$ is the total Roman $\{2\}$-domination number ${\gamma }_{tR2}(G)$. Total Roman $\{2\}$-domination was first studied in [11] and investigated in [12, 13].

It is observed in [11] that for all connected graphs $G$ of order $n$ with $\delta (G)\ge 1$, $2\le {\gamma }_{tR2}(G)\le n$ and the graphs attaining the bounds are characterized.

In this paper, we prove that for every graph $G$ of order $n$ with minimum degree at least two, ${\gamma }_{tR2}(G)\le \frac{5n}{6}$.

The proof of the following results can be found in [].

2. A Preliminary Result

Here we focus to construct an upper bound for the total Roman $\{2\}$– domination number of connected graphs with minimum degree at least two. We first make a result as follows.

For positive integers $j\ge 3$ and $l\ge 1$, let the graph $C_{j,l}$ be obtained from a cycle $C_j=x_1{x}_2\dots x_j{x}_1$ by adding a pendant path $x_1{y}_1{y}_2\dots y_l$.

Let ${\mathcal{R}}_1$ be the family of all connected loopless multigraphs with minimum degree at least three and let $\mathcal{R}$ be the family of all graphs constructed by some graph in ${\mathcal{R}}_1$ by subdividing whole edges $t$ times with $1\le t\le 5$. We observe that any graph in $\mathcal{R}$ has order at least 5.

Proof. Let $G\in \mathcal{R}$ be a graph of order $n$. We continue the proof by induction on $n$. If $n=5$, then $G$ is isomorphic to $K_{2,3}$ and clearly the result holds. Assume that $n\ge 6$ and let the result hold for any graph of $\mathcal{R}$ of order smaller than $n$. Let $G\in \mathcal{R}$ be a graph of order $n\ge 6$. Let $M=\{u\in V(G)\mid {\mathrm{deg}}_G(u)\ge 3\}$ and let $N=V(G)-M$. By definition we have $|M|\ge 2$. An $M$-ear path in $G$ is a path $W$ of $G$ so that $V(W)\subseteq N$ and the endvertices of $W$ are adjacent to vertices of $M$. For each $i\ge 1$, define ${\mathcal{W}}_i=\{W\mid W$ is an $M$-ear path with $|V(W)|=i\}$. Let $\mathcal{W}=\bigcup _{i\ge 1}{\mathcal{W}}_i$. Observe that $M\cup \bigcup _{W\in \mathcal{W}}V(W)$ is a partition of $V(G)$. For each $M$-ear path $W\in \mathcal{W}$, let $X_W=\{w\in M\mid w$ is adjacent to a leaf of $W\}$. Clearly $M=\bigcup _{W\in \mathcal{W}}{X}_W$ and $|X_W|=2$ for each $W\in \mathcal{W}$. First let there exist an $M$-ear path $W=x_1{x}_2\dots x_k\in {\mathcal{W}}_4\cup {\mathcal{W}}_5$ and $X_W=\{t_1,t_2\}$ so that $t_1{x}_1,t_2{x}_k\in E(G)$. Assume that the graph $G^{\prime }$ is obtained from $G$ by removing $x_2,\dots ,x_k$ and adding the edge $x_1{t}_2$. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ such that $f(t_1),f(t_2)\ge 1$ and $\omega (f)\le \frac{5(n-k+1)}{6}$. If $f(x_1)\ge 1$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(x_2)=0,g(x_3)=g(x_4)=\dots =g(x_k)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. If $f(x_1)=0$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(x_4)=0,g(x_i)=1$ for $i\in \{2,\dots ,k\}-\{4\}$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Hence, we may assume that ${\mathcal{W}}_4\cup {\mathcal{W}}_5=\mathrm{\varnothing }$. Therefore $\mathcal{W}={\mathcal{W}}_1\cup {\mathcal{W}}_2\cup {\mathcal{W}}_3$. For each $i\in \{1,2,3\}$, let $m_i=|{\mathcal{W}}_i|$. Then we have that $n=|M|+m_1+2m_2+3m_3$ and $m_1+m_2+m_3\ge 3$. First let $|M|=2$ and let ${\mathcal{W}}_3=\{v_1^i{v}_2^i{v}_3^i|1\le i\le m_3\}$ if ${\mathcal{W}}_3\ne \mathrm{\varnothing }$ and ${\mathcal{W}}_2=\{w_1^j{w}_2^j|1\le j\le m_2\}$ when ${\mathcal{W}}_2\ne \mathrm{\varnothing }$. If ${\mathcal{W}}_3\ne \mathrm{\varnothing }$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(y)=1$ for $y\in M$, $g(v_1^i)=g(v_3^i)=1$ for each $1\le i\le m_3$, $g(w_2^j)=1$ for each $1\le j\le m_2$ and $g(y)=0$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. Therefore assume that ${\mathcal{W}}_3=\mathrm{\varnothing }$. If $m_2\ge 2$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(y)=1$ for $y\in M$, $g(w_1^1)=1$, $g(w_2^j)=1$ for each $2\le j\le m_2$ and $g(y)=0$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. If $m_2=1$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(y)=1$ for $y\in M$, $g(w_1^1)=g(w_2^1)=1$ and $g(y)=0$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3 since $m_1\ge 2$. If $m_3=m_2=0$, then let $z\in V(G)-M$ and define the function $g:V(G)\to \{0,1,2\}$ by $g(y)=1$ for $y\in M\cup \{z\}$ and $g(y)=0$ otherwise. Clearly $g$ is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)\le \frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Henceforth, we may assume that $|M|\ge 3$. First let there are two vertices $v,u\in M$ such that ${\mathrm{deg}}_G(u),{\mathrm{deg}}_G(v)\ge 4$ and there is an $M$-ear path $uWv$ in $F$. Let $G^{\prime }=G-V(W)$ and $W=v_1{v}_2\dots v_k$. By assumption we have $k\in \{1,2,3\}$ and $G^{\prime }\in \mathcal{R}$. By the induction hypothesis on $G^{\prime }$, it has a total Roman $\{2\}$-dominating function $f$ such that $f(u),f(v)\ge 1$. If $k=1$, then $f$ can be extended to a total Roman $\{2\}$-dominating function of $G$ by labeling a 0 to $v_1$, if $k=2$, then $f$ can be extended to a total Roman $\{2\}$-dominating function of $G$ by labeling a 0 to $v_1$ and 1 to $v_2$, and if $k=3$, then $f$ can be extended to a total Roman $\{2\}$-dominating function of $G$ by labeling a 0 to $v_2$ and 1 to $v_1,v_3$. In either case we obtain a total Roman $\{2\}$-dominating function of $G$ with weight at most $\frac{5n}{6}$ with desired property. Thus we may assume that there is no $M$-ear path $uWv$ such that ${\mathrm{deg}}_G(u),{\mathrm{deg}}_G(v)\ge 4$. We distinguish two cases.

Case 1. ${\mathcal{W}}_3\ne \mathrm{\varnothing }$.

Let $W=x_1{x}_2{x}_3\in {\mathcal{W}}_3$ and $u{x}_1{x}_2{x}_{3}v$ be a path in $G$ where $v,u\in M$. By assumption, we may assume without loss generality that ${\mathrm{deg}}_G(u)=3$. We distinguish the following situations.

Subcase 1.1. $u$ is joined to three $M$-ear paths in ${\mathcal{W}}_3$.

Let $W_2=y_1{y}_2{y}_3$ and $W_3=z_1{z}_2{z}_3$ be two $M$-ear paths in ${\mathcal{W}}_3$ different from $W$, such that $u{z}_1,u{y}_1,t{z}_3,t^{\prime }{y}_3\in E(G)$.

Suppose that the graph $G^{\prime }$ is obtained from $G-{\cup }_{i=2}^3\{x_i,y_i,z_i\}$ by joining $x_1$, $y_1$ and $z_1$ to $v$, $t^{\prime }$ and $t$, respectively. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ of weight $\omega (f)\le \frac{5(n-6)}{6}$ and that labels by positive values any vertex of degree at least 3.

In particular, $min\{f(u),f(t),f(t^{\prime })\}\ge 1$. To total dominate $u$, we can suppose that $f(x_1)\ge 1$. Define $g:V(G)\to \{0,1,2\}$ by $g(x_3)=g(y_1)=g(z_1)=g(y_3)=g(z_3)=1$, $g(y_2)=g(z_2)=g(x_2)=0$ and $g(y)=f(y)$ otherwise. Clearly, $g$ is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+5\le \frac{5(n-6)}{6}+5=\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Subcase 1.2. $u$ is adjacent to two $M$-ear paths in ${\mathcal{W}}_3$ and to an $M$-ear path in ${\mathcal{W}}_2$.

Let $W_2=y_1{y}_2{y}_3\in {\mathcal{W}}_3$ be the other $M$-ear paths in ${\mathcal{W}}_3$ and$W_3=z_1{z}_2\in {\mathcal{W}}_2$ such that $u{z}_1,u{y}_1\in E(G)$. {Assume that {$t{y}_3,t^{\prime }{z}_2\in E(G)$, and} let {the graph $G^{\prime }$ be obtained from $G-\{x_2,x_3,y_2,y_3,z_2\}$ {{by joining $x_1$, $y_1$ and $z_1$ to $v$, $t$ and $t^{\prime }$, respectively}. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a {total Roman $2$-dominating function} $f$ of $G^{\prime }$ {of weight $\omega (f)\le \frac{5(n-5)}{6}$ and that labels by positive values any vertex of degree at least 3.

In particular, $f(u)\ge 1$. To total dominate $u$, we can suppose that $f(x_1)\ge 1$. Define $g:V(G)\to \{0,1,2\}$ by $g(x_3)=g(y_1)=g(y_3)=g(z_1)=1$, $g(x_2)=g(y_2)=g(z_2)=0$ and {$g(y)=f(y)$} otherwise. Clearly $g$ is a {total Roman $\{2\}$-dominating function} {of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-5)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Subcase 1.3. $u$ is adjacent to two $M$-ear paths in ${\mathcal{W}}_3$ and to a $M$-ear path in ${\mathcal{W}}_1$.

Let $W_2=y_1{y}_2{y}_3\in {\mathcal{W}}_3$ be the other $M$-ear paths in ${\mathcal{W}}_3$ and $W_3=t^{″}\in {\mathcal{W}}_1$ such that $u{t}^{″},u{y}_1,t{y}_3,t^{\prime }{t}^{″}\in E(G)$. First let $M$ be the set of all vertices of degree at least three and independent in $G$. First let $|\{v,t,t^{\prime }\}|=3$. Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,x_3,u,y_1,y_2\}$ by joining $y_3$ and $t^{″}$ to $v$ and $t$, respectively.

Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ such that $f$ assigns a positive value for any vertex of degree at least three, and $\omega (f)\le \frac{5(n-6)}{6}$. If $f(y_3)+f(t^{″})=0$, then the function $g:V(G)\to \{0,1,2\}$ define by $g(x_3)=0$, $g(x_1)=g(x_2)=g(y_1)=g(y_2)=g(u)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+5\le \frac{5(n-6)}{6}+5=\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

If $f(y_3)=1$, then the function $g:V(G)\to \{0,1,2\}$ by $g(y_2)=g(x_2)=0$, $g(x_1)=g(x_3)=g(u)=g(y_1)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-6)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

For the next, we can assume that $|\{v,t,t^{\prime }\}|<3$. Suppose that $t=t^{\prime }$ and $t\in M-\{v,u\}$ (the case $v=t^{\prime }$ and $v\in M-\{u,t\}$ is similar). Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,y_1,y_2,u,t^{″}\}$ by joining $x_3$ and $y_3$ to $t=t^{\prime }$ and $v$, respectively. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ of weight $\omega (f)\le \frac{5(n-6)}{6}$ and that labels by positive values any vertex of degree at least 3.

If $f(x_3)\ge 1$ (the case $f(y_3)\ge 1$ is similar), then the function $g:V(G)\to \{0,1,2\}$ by $g(x_2)=0$, $g(x_1)=g(u)=g(y_1)=g(y_2)=g(t^{″})=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+5\le \frac{5(n-6)}{6}+5=\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Assume that $f(x_3)+f(y_3)=0$. Then the function $g:V(G)\to \{0,1,2\}$ by $g(t^{″})=0$, $g(x_1)=g(x_2)=g(u)=g(y_1)=g(y_2)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+5\le \frac{5(n-6)}{6}+5=\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Next assume that $t=v$ and $v\ne t^{\prime }$. Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,y_1,y_2,t^{″},u\}$ by joining $t^{\prime }$ to $x_3$ and $y_3$. A method similar to that described above we can see that $\omega (g)\le \frac{5n}{6}$.

Finally suppose that $v=t=t^{\prime }$. Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,y_1,u\}$ by joining $y_2$ to $x_3$ and $t^{″}$. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ such that $f$ labels a positive value for any vertex of degree at least three and $\omega (f)\le \frac{5(n-4)}{6}$. Then $f(y_2)\ge 1$. If $f(y_3)=1$, the function $g:V(G)\to \{0,1,2\}$ by $g(y_1)=0$, $g(x_1)=g(u)=g(x_2)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ such that $g$ labels a positive value for any vertex of degree at least three, and we have $\omega (g)=\omega (f)+3\le \frac{5(n-4)}{6}+3<\frac{5n}{6}$. Assume that $f(y_3)=0$. Then $f(t^{″})+f(x_3)\ge 1$, and the function $g:V(G)\to \{0,1,2\}$ defined by $g(t^{″})=g(x_3)=g(y_1)=0$, $g(x_1)=g(x_2)=g(u)=g(y_3)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+3\le \frac{5(n-4)}{6}+3<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Subcase 1.4. $u$ is adjacent to an $M$-ear path in ${\mathcal{W}}_3$ and is adjacent to two $M$-ear paths in ${\mathcal{W}}_2$.

Let $W_i=y_1^i{y}_2^i\in {\mathcal{W}}_2$ for $i\in \{1,2\}$ such that $u{y}_1^1,u{y}_1^2,t{y}_2^1,t^{\prime }{y}_2^2\in E(G)$. Let the graph $G^{\prime }$ be obtained from $G-\{x_1,u,y_1^1,y_1^2\}$ by joining $x_2$ to $y_2^i$ for $i\in \{1,2\}$. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ of weight $\omega (f)\le \frac{5(n-4)}{6}$ and that labels by positive values any vertex of degree at least 3.

In particular, $min\{f(x_2),f(t),f(t^{\prime })\}\ge 1$. Also to totally dominate $x_2$ we must have $f(x_3)+f(y_2^1)+f(y_2^2)\ge 1$. If $f(x_3)\ge 1$, then the function $g:V(G)\to \{0,1,2\}$ by $g(x_1)=0$, $g(y_1^1)=g(u)=g(y_1^2)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+3\le \frac{5(n-4)}{6}+3<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. If $f(y_2^1)\ge 1$ (the case $f(y_2^2)\ge 1$ is similar), then the function $g:V(G)\to \{0,1,2\}$ by $g(y_1^1)=0$, $g(x_1)=g(u)=g(y_1^2)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

Subcase 1.5. $u$ is adjacent to an $M$-ear path in ${\mathcal{W}}_3$, an $M$-ear path in ${\mathcal{W}}_2$ and an $M$-ear path in ${\mathcal{W}}_1$.

Let $W_2=y_1{y}_2\in {\mathcal{W}}_2$ and $W_3=t^{″}\in {\mathcal{W}}_1$ such that $u{y}_1,u{t}^{″}\in E(G)$ and $t{y}_2,t^{\prime }{t}^{″}\in E(G)$. We consider the following situations.

(a) $|\{v,t,t^{\prime }\}|=3$.
Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,x_3,u,y_1,\}$ by joining $v$ and $t^{″}$ to $y_2$ and $t$, respectively. Clearly $G^{\prime }\in \mathcal{R}$ and by the induction hypothesis, $G^{\prime }$ has a total Roman $\{2\}$-dominating function $f$ of weight $\omega (f)\le \frac{5(n-5)}{6}$ and that labels by positive values any vertex of degree at least 3. If $f(y_2)=f(t^{″})=0$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(x_1)=0$, $g(x_2)=g(x_3)=g(y_1)=g(u)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-5)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. If $f(y_2)\ge 1$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(x_1)=g(y_1)=0$, $g(x_2)=g(x_3)=g(u)=1$, $g(t^{″})=max\{1,f(t^{″})\}$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-5)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3. If $f(y_2)=0,f(t^{″})\ge 1$, then the function $g:V(G)\to \{0,1,2\}$ defined by $g(x_1)=g(y_1)=0$, $g(x_2)=g(x_3)=g(u)=g(y_2)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-5)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

(b) $t=t^{\prime }$ and $v\ne t$.
Suppose that the graph $G^{\prime }$ is obtained from $G-\{x_1,x_2,x_3,u,y_1,\}$ by joining $v$ to $y_2$ and $t^{″}$. Clearly $G^{\prime }\in \mathcal{R}$ and by the induction hypothesis, $G^{\prime }$ has a total Roman $\{2\}$-dominating function $f$ of weight $\omega (f)\le \frac{5(n-5)}{6}$ and that labels by positive values any vertex of degree at least 3. Define $g:V(G)\to \{0,1,2\}$ by $g(x_1)=0$, $g(x_2)=g(x_3)=g(u)=g(y_1)=1$ and $g(y)=f(y)$ otherwise, is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4\le \frac{5(n-5)}{6}+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

(c) $v=t$ and $v\ne t^{\prime }$.
Suppose that the graph $G^{\prime }$ is obtained from $G-\{u,x_1,x_2,y_1,t^{″}\}$ by joining $t^{\prime }$ to $x_3$ and $y_2$. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ of weight $\omega (f)\le \frac{5(n-5)}{6}$ and that labels by positive values any vertex of degree at least 3. Define $g:V(G)\to \{0,1,2\}$ by $g(t^{″})=0$, $g(x_1)=g(x_2)=g(y_1)=g(u)=1$ and $g(y)=f(y)$ otherwise, if $f(x_3)=f(y_2)=0$, by $g(x_2)=0$, $g(x_1)=g(y_1)=g(u)=g(t^{″})=1$ and $g(y)=f(y)$ otherwise, if $f(x_3)\ge 1$, and by $g(y_1)=0$, $g(x_1)=g(x_2)=g(u)=g(t^{″})=1$ and $g(y)=f(y)$ otherwise, when $f(y_2)\ge 1$. Clearly $g$ is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.

(d) $v=t^{\prime }$ and $v\ne t$.
Suppose that the graph $G^{\prime }$ is obtained from $G-\{u,x_1,x_2,y_1,y_2\}$ by joining $t$ to $x_3$ and $t^{″}$. Clearly, $G^{\prime }\in \mathcal{R}$. By the induction hypothesis, there exists a total Roman $\{2\}$-dominating function $f$ of $G^{\prime }$ of weight $\omega (f)\le \frac{5(n-5)}{6}$ and that labels by positive values any vertex of degree at least 3. Define $g:V(G)\to \{0,1,2\}$ by $g(y_2)=0$, $g(x_1)=g(x_2)=g(y_1)=g(u)=1$ and $g(y)=f(y)$ otherwise, if $f(x_3)=f(t^{″})=0$, by $g(x_2)=0$, $g(x_1)=g(y_1)=g(y_2)=g(u)=1$ and $g(y)=f(y)$ otherwise, if $f(x_3)\ge 1$, and by $g(y_1)=0$, $g(x_1)=g(x_2)=g(u)=g(y_2)=1$ and $g(y)=f(y)$ otherwise, when $f(t^{″})\ge 1$. Clearly $g$ is a total Roman $\{2\}$-dominating function of $G$ of weight $\omega (g)=\omega (f)+4<\frac{5n}{6}$ and that labels by positive values any vertex of degree at least 3.