On the Paired-Domination Subdivision Number of a Graph

Abstract

In order to increase the paired-domination number of a graph G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$ of G. It is well known that ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)$ can be smaller or larger than ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$ for some edge $e\notin E\left(G\right).$ In this note, we show that, if G is an isolated-free graph different from $m{K}_2,$ then, for every edge $e\notin E\left(G\right)$, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2\Delta \left(G\right)$.

1. Introduction

All graphs considered in this paper are finite, simple, and undirected. Let $V\left(G\right)$ and $E\left(G\right)$ be the vertex set and edge set of a graph G, respectively. The open neighborhood $N_G\left(v\right)$ of a vertex v in G is the set of all vertices that are adjacent to v, the closed neighborhood$N_G\left[v\right]$ is the set $N_G\left(v\right)\cup \left\{v\right\}$, and the set of edges incident with v is $E\left(v\right).$ The degree of a vertex v is the number of vertices in $N_G\left(v\right)$. The maximum degree among all vertices of G is denoted by $\Delta \left(G\right)$. The union of simple graphs G and H is the graph $G\cup H$ with vertex set $V\left(G\right)\cup V\left(H\right)$ and edge set $E\left(G\right)\cup E\left(H\right)$. A star of order $n\ge 2$ is the complete bipartite graph $K_{1,n-1}$. The center of the star is the vertex of maximum degree.

A leaf of G is a vertex with degree one and a support vertex is a vertex adjacent to a leaf. For a vertex subset $S\subseteq V\left(G\right)$, we denote by $G\left[S\right]$ the subgraph induced by S. A subdivision of an edge $uv$ is obtained by removing the edge $uv$, adding a new vertex w, and adding edges $uw$ and $wv$. Throughout this paper, when an edge $e=uv$ is subdivided, the subdivision vertex for e is denoted by $w_e=w_{uv}$. For a set F of edges in a graph G, we use $G_F$ to denote the graph obtained from G by subdividing every edge in $F.$ Note that $w_e\ne w_f$ for every two different edges $e,f\in F.$

A set $S\subseteq V\left(G\right)$ is a paired-dominating setof G, PD-set for short, if each vertex in $V\left(G\right)\backslash S$ has at least one neighbor in S and $G\left[S\right]$ contains a perfect matching. The minimum cardinality of a PD-set of G is called the paired-domination number of G and is denoted by ${\gamma }_{pr}\left(G\right)$. Let S be a PD-set of G with a perfect matching M. Then, two vertices u and v are called partners (or paired) inS if the edge $uv\in M$. Paired domination in graphs was first studied in [1] and has been studied since then by several authors (for example, see [2,3,4,5,6]). The literature on the subject of paired domination has been detailed in the recent book chapter [7].

As good models of many practical problems, graphs sometimes have to be changed to adapt the changes in reality. Thus, we must pay attention to the change of graph parameters under graph modifications, such as deletion of vertices, deletion or addition of edges, and subdivision of edges. For example, Kok and Mynhardt [8] introduced the reinforcement number, which is the minimum number of edges which must be added to G in order to decrease the domination number of G. Fink et al. [9] introduced the bondage number of a graph, which is the minimum number of edges in which removal increases the domination number. For the subdivision of edges, Velammal [10], in his thesis, introduced the domination subdivision number which is the minimum number of edges that must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. The study of this kind of problems has been extended to other domination parameters (see, for instance [11,12,13,14,15,16,17,18]).

In this paper, we are interested in studying the paired-domination subdivision number introduced by Favaron et al. in [19]. In order to increase the paired-domination number of G, the minimum number of edges that must be subdivided (where each edge in G can be subdivided no more than once) is called the paired-domination subdivision number and is denoted by ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$. We note that the subdivision of the unique edge of a path of order 2 does not increase the paired-domination number. Thus, we always assume that all graphs involved have a component of order at least 3. The minimum cardinality of a set $F\subseteq E\left(G\right)$ such that ${\gamma }_{pr}\left(G_F\right)>{\gamma }_{pr}\left(G\right)$ is called an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set. The paired-domination subdivision number has been studied by several authors (see, for instance [20,21]).

Let G be a connected graph of order at least 3. Favaron et al. [19] posed the following question: Is it true that, for any edge $e\notin E\left(G\right),$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$? A negative answer to this question was given by Egawa et al. [22]. However, they approved the question in the affirmative if the following additional condition is added: each edge $e\notin E\left(G\right)$ satisfies ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$. We can further specify that, if ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$ for some edge $e\notin E\left(G\right)$, then the difference ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)-{\mathrm{sd}}_{{\gamma }_{pr}}(G+e)$ can be arbitrary large. To see this, consider the connected graph $G_t$ obtained from $t\ge 3$ disjoint $K_2$ by adding a new vertex attached to one vertex of each $K_2.$ Now, for two leaves x and y of $G_t$, one can easily see that ${\gamma }_{pr}\left(G_t\right)={\mathrm{sd}}_{{\gamma }_{pr}}\left(G_t\right)=2t$, while ${\gamma }_{pr}(G_t+xy)=2t-2$ and ${\mathrm{sd}}_{{\gamma }_{pr}}(G_t+xy)=3$.

Let $S_t(t\ge 4)$ denote the subdivided star obtained from a star $K_{1,t-1}$ of order t by subdividing all edges of $K_{1,t-1}$. Let $G_1$ be obtained from t copies of $S_t$ by adding a new vertex x and joining x to the central vertices of subdivided stars, $G_2$ be obtained from $t-1$ copies of $S_t$ by adding a new vertex y and joining y to the central vertices of subdivided stars and adding a pendant edge $yz$, and let $G_t$ be the union $G_1\cup G_2$. Note that $\Delta \left(G_t\right)=t$. It is not hard to verify that ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G_t\right)=t$ and ${\mathrm{sd}}_{{\gamma }_{pr}}(G_t+xz)=2t+1={\mathrm{sd}}_{{\gamma }_{pr}}\left(G_t\right)+\Delta \left(G_t\right)+1$, where the graph $G_t+xz$ for $t=4$ is illustrated in Figure 1. Hence, the difference of ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)-{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$ can be arbitrary large for some edge $e\notin E\left(G\right)$. Thus, an interesting problem is to find good bounds on ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)$ in terms of ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$ and $\Delta \left(G\right)$ if $e\notin E\left(G\right)$.

In this paper, we provide an upper bound for ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)$ for any $e\notin E\left(G\right)$ in terms of ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$ and $\Delta \left(G\right)$, the proof of which will be given in Section 3. More precisely, we mainly show the following.

Theorem 1.

Let G be an isolated-free graph different from $m{K}_2.$ Then, for every $e\notin E\left(G\right)$,

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2\Delta \left(G\right).$$

Furthermore, this bound is sharp.

We close this section by recalling three useful results.

Proposition 1

([19]). For any connected graph G of order at least three and any graph $G^{\prime }$ formed from G by subdividing an edge $e\in E\left(G\right)$, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G\right)$.

Proposition 2

([22]). Let G be a graph with no isolated vertex. Then, for every edge $e\notin E\left(G\right)$, either ${\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$ or ${\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)+2$.

Proposition 3

([22]). Let G be a connected graph of order at least three, and let $e\notin E\left(G\right)$ satisfy ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$. Then, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$.

2. Preliminary Results

In this section, we give some preliminary results useful for the proof of Theorem 1. We begin by extending the result of Proposition 3 to disconnected graphs different from $m{K}_2$ and having no isolated vertices.

Proposition 4.

Let G be an isolated-free graph different from $m{K}_2$. If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$ for some edge $e\notin E\left(G\right),$ then ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$.

Proof. 

Let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set and observe that $G_F+e={(G+e)}_F$. We shall show that ${\gamma }_{pr}(G_F+e)>{\gamma }_{pr}(G+e)$. Assume that $e=xy$ and let P be a ${\gamma }_{pr}(G_F+e)$-set. If $P\cap \{x,y\}=\varnothing$ or $x,y\in P$, and they are not partners in P, then, clearly, P is a PD-set of $G_F$, so ${\gamma }_{pr}\left({(G+e)}_F\right)\ge {\gamma }_{pr}\left(G_F\right)>{\gamma }_{pr}\left(G\right)>{\gamma }_{pr}(G+e)$. Hence, we assume that $P\cap \{x,y\}\ne \varnothing$. First, let $x,y\in P$ be two partners in P. Since P is a ${\gamma }_{pr}(G_F+e)$-set, we may assume that $N_{G_F}\left(x\right)⊈P$. Let $x^{\prime }\in N_{G_F}\left(x\right)\backslash P$. If y has a neighbor $y^{\prime }\in V-P$, then the set $P\cup \{x^{\prime },y^{\prime }\}$ (in which x and y are partners with $x^{\prime }$ and $y^{\prime },$ respectively) is a PD-set of $G_F$; thus, ${\gamma }_{pr}\left({(G+e)}_F\right)\ge {\gamma }_{pr}\left(G_F\right)-2\ge {\gamma }_{pr}\left(G\right)>{\gamma }_{pr}(G+e)$.

Hence, we can assume that $N_{G_F}\left(y\right)\subseteq P.$ Then, the set $(P\backslash \left\{y\right\})\cup \left\{x^{\prime }\right\}$ (in which x and $x^{\prime }$ are partners) is a PD-set of $G_F$, and the result follows as above. Finally, let $|P\cap \{x,y\left\}\right|=1$. Without loss of generality, assume that $x\in P$. If y has a neighbor in P other than x, then P is a PD-set of $G_F$ and the result follows as above. Now, if x is the unique neighbor of y in $P,$ then, by considering a vertex $y^{\prime }\in N_{G_F}\left(y\right)$, one can see that the set $P\cup \{y,y^{\prime }\}$ (in which y and $y^{\prime }$ are partners) is a PD-set of $G_F$; thus, ${\gamma }_{pr}\left({(G+e)}_F\right)\ge {\gamma }_{pr}\left(G_F\right)-2\ge {\gamma }_{pr}\left(G\right)>{\gamma }_{pr}(G+e)$. In either case, ${\gamma }_{pr}(G_F+e)>{\gamma }_{pr}(G+e),$ implying that ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$, which completes the proof. □

Lemma 1.

Let G be an isolated-free graph different from $m{K}_2$. If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$ for some edge $e\notin E\left(G\right),$ then ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le 3$.

Proof. 

Assume that $e=xy,$ and let $x_1\in N_G\left(x\right)$ and $y_1\in N_G\left(y\right)$. We denote by $G^{\prime }$ the graph formed from $G+e$ by subdividing the three edges $e,x{x}_1,y{y}_1$ and adding three new vertices $z_1,z_2,z_3$, respectively. In addition, we denote by $G_1$ the graph formed from G by subdividing the two edges $x{x}_1,y{y}_1$ and adding two new vertices $z_2,z_3$, respectively, and we denote by $G_2$ the graph formed from G by subdividing only the edge $x{x}_1$ and adding a new vertex $z_2$. Let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set. If $z_1\notin P$, then P is a PD-set of $G_1$, so ${\gamma }_{pr}\left(G^{\prime }\right)=\left|P\right|\ge {\gamma }_{pr}\left(G_1\right)\ge {\gamma }_{pr}\left(G\right)>{\gamma }_{pr}(G+e)$. Hence, assume that $z_1\in P$, and let, without loss of generality, x be the partner of $z_1$ in P.

Assume first that $(N_{G^{\prime }}\left[y\right]-\left\{z_1\right\})\cap P\ne \varnothing$. If x has a neighbor w in $G^{\prime }-\left\{z_1\right\}$ such that $w\notin P$, then $(P-\left\{z_1\right\})\cup \left\{w\right\}$ is a PD-set of $G_1$, and, as before, we have ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. Thus, we can assume that all neighbors of x in $V\left(G^{\prime }\right)-\left\{z_1\right\}$ belong to P. Then, clearly, $P-\{x,z_1\}$ is a PD-set of $G_1$, and, as before, ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. Assume now that $(N_{G^{\prime }}\left[y\right]-\left\{z_1\right\})\cap P=\varnothing$. Then, we have $y_1\in D$. If x has a neighbor w in $V\left(G^{\prime }\right)-\left\{z_1\right\}$ such that $w\notin P$, then $(P-\left\{z_1\right\})\cup \left\{w\right\}$ is a PD-set of $G_2$, and, as above, one can easily see that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. Finally, if all neighbors of x in $G^{\prime }-z_1$ belongs to P, then $P-\{x,z_1\}$ is a PD-set of $G_2$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. Therefore, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le 3$. □

As an immediate consequence of Proposition 4 and Lemma 1, we, therefore, have the following result.

Corollary 1.

Let G be an isolated-free graph different from $m{K}_2$. If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$ for some edge $e\notin E\left(G\right),$ then ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le min\{3,{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)\}$.

Lemma 2.

For any isolated-free graph G different from $m{K}_2$, let F be a set of edges of G in which subdivision increases ${\gamma }_{pr}\left(G\right)$, $e=xy\notin E\left(G\right)$, and let $G^{\prime }$ be the graph formed from $G+e$ by subdividing the edges in $F\cup \left\{e\right\}.$ If P is a ${\gamma }_{pr}\left(G^{\prime }\right)$-set such that $w_e\notin P$ or $x,y\in P$, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le \left|F\right|+1.$$

Proof. 

According to Proposition 4, we may assume that ${\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$ (otherwise, the result is straightforward from this proposition). If $w_{xy}\notin P$, then, clearly, P is a PD-set of $G_F$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_F\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Hence, assume that $w_{xy}\in P$. Since, by assumption, $x,y\in P$, we may assume, without loss of generality, that x and $w_{xy}$ are partners in P. If all neighbors of x in $V\left(G^{\prime }\right)-\left\{w_{xy}\right\}$ belong to P, then $P-\{x,w_{xy}\}$ is a PD-set of $G_F$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_F\right)+2>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Now, if x has a neighbor w in $V\left(G^{\prime }\right)-\left\{w_{xy}\right\}$, then $(P-\left\{w_{xy}\right)\cup \left\{w\right\}$ is a PD-set of $G^{″}$, and, as before, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_F\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$, which completes the proof. □

Lemma 3.

Let G be an isolated-free graph different from $m{K}_2$, and let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set. If $e=xy\notin E\left(G\right)$ such that $E\left(x\right)⊈F$ and $E\left(y\right)⊈F$, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+3.$$

Proof. 

If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$, then by Corollary 1, the assertion is trivial. So, in the following, we may assume that ${\gamma }_{pr}(G+e)={\gamma }_{pr}\left(G\right)$. Since $E\left(x\right)⊈F$ and $E\left(y\right)⊈F$, let $t_1$ and $t_2$ be the neighbors of x and $y,$ respectively, such that $t_{1}x,t_{2}y\notin F$. Let $G^{\prime }$ be the graph formed from $G+e$ by subdividing the edges in $F\cup \{e,x{t}_1,y{t}_2\}$. We denote by P a ${\gamma }_{pr}\left(G^{\prime }\right)$-set. According to Lemma 2, we may assume that $w_e\in P$ and $|P\cap \{x,y\left\}\right|=1$ (otherwise, the result is straightforward from this lemma). Without loss of generality, assume that x is the partner of $w_e$.

First, let $(N_{G^{\prime }}\left[y\right]-\left\{w_e\right\})\cap P\ne \varnothing$. If x has a neighbor w in $V\left(G^{\prime }\right)$ such that $w\notin P$, then, clearly, $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_1$ which is obtained from G by subdividing the edges of $F\cup \{x{t}_1,y{t}_2\}.$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_1\right)\ge {\gamma }_{pr}\left(G_F\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Hence, we assume that all neighbors of x in $V\left(G^{\prime }\right)$ belong to P. In this case, $P-\{x,w_{xy}\}$ is a PD-set of $G_1$, and, as before, we obtain ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$.

Assume now that $(N_{G^{\prime }}\left[y\right]-\left\{w_{xy}\right\})\cap P=\varnothing$. Therefore, $t_2\in P$ (to paired-dominates $w_{x{t}_2}$). If x has a neighbor w in $G^{\prime }-\left\{w_{xy}\right\}$ such that $w\notin P$, then, clearly, $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_2$ which is obtained from G by subdividing the edges of $F\cup \left\{x{t}_1\right\}$, and as before one can see that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. Hence, we can assume that all neighbors of x in $G^{\prime }-\left\{w_{xy}\right\}$ belong to P. In this case, $P-\{x,w_{xy}\}$ is a PD-set of $G_2$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e).$ In either case, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+3.$ □

Lemma 4.

Let G be an isolated-free graph different from $m{K}_2$. If $e=xy\notin E\left(G\right)$ such that x or y is a support vertex, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2.$$

Proof. 

If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right)$, then the result follows from Proposition 4. Hence, we assume that ${\gamma }_{pr}(G+e)={\gamma }_{pr}\left(G\right)$. Without loss of generality, let x be a support vertex, and let $x{x}_1$ be a pendant edge. Suppose that F is an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set. We denote by $G_1$ the graph formed from G by subdividing the edges in F. In addition, we denote by $G_2$ the graph formed from G by subdividing the edges in $F\cup \left\{x{x}_1\right\}$, and we denote by $G^{\prime }$ the graph formed from $G+e$ by subdividing the edges in $F\cup \{e,x{x}_1\}$. Let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set. By Lemma 2, we may assume that $w_e\in P$ and $|P\cap \{x,y\left\}\right|=1$ (otherwise, the result is straightforward from this lemma).

First, let x be the partner of $w_{xy}$ in P. Then, we must have $x_1,w_{x{x}_1}\in P$. If $N_{G^{\prime }}\left[y\right]\cap (P-\left\{w_{xy}\right\})\ne \varnothing$, then the set $P-\{w_{xy},x_1\}$ in which x and $w_{x{x}_1}$ are partners, is a PD-set of $G_2$ yielding ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Hence, assume that $N_{G^{\prime }}\left[y\right]\cap (P-\left\{w_{xy}\right\})=\varnothing$ and let w be a neighbor of y in $G^{\prime }.$ Then, the set $(P-\{w_{xy},x_1\})\cup \{y,w\}$ in which x and y are partners with $w_{x{x}_1}$ and $w,$ respectively, is a PD-set of $G_2.$ As before, we get ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$.

Now, assume that y is the partner of $w_{xy}$ in P. Clearly, $w_{x{x}_1}\in P$ (to paired-dominates $x_1$). If y has a neighbor w in $V\left(G^{\prime }\right)-\left\{w_{xy}\right\}$ such that $w\notin P$, then $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_2$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)\ge {\gamma }_{pr}\left(G_1\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Now, if all neighbors of y in $V\left(G^{\prime }\right)-\left\{w_{xy}\right\}$ belong to P, then $P-\{y,w_{xy}\}$ is a PD-set of $G_2$, and, as before, we obtain ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$. In either case, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+1.$ □

Before going further, we give some notation and definitions. For a vertex $x\in V\left(G\right)$, the set of isolated vertices in the subgraph induced by $N_G\left(x\right)$ is denoted by $IS\left(x\right)$. We also denote by $X_G$ the set of pairs $(x,y)$ of non-adjacent vertices in G. Moreover, for a pair $(x,y)\in X_G$, let $E(x,y)=\{tx\mid ty\in E(y\left)\right\},$ in other words, $E(x,y)$ is the set of edges incident with x in which end vertices are neighbors of $y.$ In addition, we consider two functions $q_1$ and $q_2$ on $X_G$ as follows.

(a)

$q_1:X_G\to {\mathbb{N}}^{\ge 0}$ defined by $q_1(x,y)=2$ if neither $N\left(x\right)$ nor $N\left(y\right)$ is independent, and

$$q_1(x,y)=min\left\{min\left\{\right|N\left(v\right)\cap (V-N[x\left]\right)|:v\in IS(x\left)\right\},min\left\{\right|N\left(u\right)\cap (V-N[y\left]\right)|:u\in IS(y\left)\right\}\right\}$$

otherwise. Note that $q_1(x,y)=0$ if and only if x or y is a support vertex.

(b)

$q_2:X_G\to {\mathbb{N}}^{\ge 0}$ defined by $q_2(x,y)=2$ if there exits an sd${}_{{\gamma }_{pr}}\left(G\right)$-set M such that $E\left(x\right)⊈M$ and $E\left(y\right)⊈M$, and

$$q_2(x,y)=min\left\{\right|(E\left(x\right)\cup E\left(y\right))\backslash M|-|E(x,y)\backslash M|:M\mathrm{is}\mathrm{a}{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)-\mathrm{set}\}$$

otherwise.

Lemma 5.

Let G be an isolated-free graph different from $m{K}_2$, and let $e=xy\notin E\left(G\right)$.

1. 

If neither $N\left(x\right)$ nor $N\left(y\right)$ is independent, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+3+max\{q_2(x,y),q_2(y,x)\}\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3.$$

2. 

If F is an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set such that $E\left(x\right)\subseteq F$, $E\left(y\right)⊈F$ and $N\left(y\right)$ is not independent, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(x,y)+2\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2.$$

3. 

If $N\left(x\right)\cap N\left(y\right)\ne \varnothing$, then

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2+min\{\Delta \left(G\right),max\{q_2(x,y),q_2(y,x)\}\}.$$

Proof. 

According to Proposition 4, we may assume that ${\gamma }_{pr}(G+e)={\gamma }_{pr}\left(G\right)$. Note that since G is isolated-free and different from $m{K}_2,$$\Delta \left(G\right)\ge 2.$ We now show items of the lemma one by one.

• If there is an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F such that $E\left(x\right)⊈F$ and $E\left(y\right)⊈F$, then $q_2(x,y)=2$, and, by Lemma 3, we have

  $$\begin{array}{ccc}{\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\hfill & \le \hfill & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+3\hfill \\ \hfill & \le \hfill & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+max\{q_2(x,y),q_2(y,x)\}+1\hfill \\ \hfill & \le \hfill & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+1.\hfill \end{array}$$
  Hence, we may assume that, for every ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F, $E\left(x\right)\subseteq F$ or $E\left(y\right)\subseteq F$. In that case, it is clear that ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+max\{q_2(x,y),q_2(y,x)\}+3\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3$. Now, let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set with, without loss of generality, $E\left(x\right)\subseteq F$. Since, by assumption, neither $N\left(x\right)$ nor $N\left(y\right)$ is independent, let $x_1,x_2$ be two adjacent vertices of $N\left(x\right),$ likewise $y_1,y_2$ two adjacent vertices of $N\left(y\right).$ In addition, consider the graph $G^{\prime }$ formed from $G+xy$ by subdividing the edges in $F\cup \{xy,x_1{x}_2,y_1{y}_2\}$ and all edges in $\left(E\right(y)-F)\backslash \left(E\right(y,x)-F)$ and let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set. If $w_{xy}\notin P$ or $x,y\in P$, then, by Lemma 2, we have ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le \left|F\right|+3+q_2(y,x)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3$. Hence, we may assume that $w_{xy}\in P$ and $|P\cap \{x,y\left\}\right|=1$. We claim that $w_{xy}$ is the unique subdivision vertex adjacent to x belonging to P. Suppose, to the contrary, that $w_{xz}$ is a subdivision vertex adjacent to x such that $w_{xz}\in P$. If x is the partner of $w_{xy}$, then the set $P-\{w_{xz},w_{xy}\},$ in which x and z are partners, is a PD-set of $G_1$ which is obtained from $G+e$ by subdividing all edges in $(F\cup \{x_1{x}_2,y_1{y}_2\})-\left\{xz\right\}$ and the edges of $\left(E\right(y)-F)\backslash \left(E\right(y,x)-F).$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}\left(G_1\right)\ge {\gamma }_{pr}(G+e)$; thus,

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(y,x)+1<{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3.$$
  Hence, we can now assume that y is the partner of $w_{xy}.$ If all neighbors of y in $G^{\prime }-w_{xy}$ are in P, then $P-\{y,w_{xy}\}$ is a PD-set of $G_2$ which is obtained from G by subdividing all edges in $F\cup \{x_1{x}_2,y_1{y}_2\}$ and the edges of $\left(E\right(y)-F)\backslash \left(E\right(y,x)-F).$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$; thus,

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(y,x)+1<{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3.$$
  If y has a neighbor w in $G^{\prime }-w_{xy}$ with $w\notin P$, then $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_2$ (defined before) and the desired result follows as before. Thus, $w_{xy}$ is indeed the unique subdivision vertex adjacent to x that belongs to P. We now claim that $w_{xy}$ is the unique subdivision vertex adjacent to y belonging to P. Suppose, to the contrary, that $w_{yz}$ is a subdivision vertex adjacent to y such that $w_{yz}\in P$. If y is the partner of $w_{xy}$, then the set $P-\{w_{yz},w_{xy}\},$ in which y and z are partners, is a PD-set of $G_1^{\prime }$ which is obtained from $G+e$ by subdividing all edges in $(F\cup \{x_1{x}_2,y_1{y}_2\})-\left\{yz\right\}$ and the edges of $\left(E\right(y)-F\cup \{yz\left\}\right)\backslash \left(E\right(y,x)-F).$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}\left(G_1^{\prime }\right)\ge {\gamma }_{pr}(G+e)$; thus,

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(y,x)+1<{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+3.$$
  Therefore, we may now suppose that x is the partner of $w_{xy}.$ If all neighbors of x in $G^{\prime }-w_{xy}$ are in P, then $P-\{x,w_{xy}\}$ is a PD-set of $G_2$ (defined before), and the desired result follows. If x has a neighbor w in $G^{\prime }-w_{xy}$ with $w\notin P$, then $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_2$, and the desired result follows as before. Thus, $w_{xy}$ is indeed the unique subdivision vertex adjacent to y that belongs to P. Moreover, to paired-dominate vertices $w_{x_1{x}_2}$ and $w_{y_1{y}_2}$, we may assume that $x_1,y_1\in D$. In this case, $P-\{y,w_{xy}\}$ (if y is the partner of $w_{xy}$) or $P-\{x,w_{xy}\}$ (if x is the partner of $w_{xy}$) is a PD-set of $G_3$ which is obtained from G by subdividing the edges of $(F-(E\left(x\right)\cup E\left(y\right))\cup \{x_1{x}_2,y_1{y}_2\}$, implying that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}\left(G_3\right)\ge {\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. Therefore,

  $$\begin{array}{ccc}\hfill {\mathrm{sd}}_{{\gamma }_{pr}}(G+e)& \le & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)-|E\left(x\right)\cup E\left(y\right)|+2\hfill \\ & \le & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right).\hfill \end{array}$$
• We first note that, since $E\left(x\right)\subseteq F$, we have ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(y,x)+1\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\left|E\left(y\right)\right|+1<{\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2$. In addition, since, by assumption, $E\left(y\right)⊈F$ and $N\left(y\right)$ is not independent, let $e_1=yt\in E\left(y\right)-F$, and let $y_1,y_2$ be two adjacent vertices of $N\left(y\right)$. We denote by $G_1$ the graph formed from $G+xy$ by subdividing the edges of $F\cup \left\{y_1{y}_2\right\}$ and all edges in $(E\left(y\right)-F)\backslash (E(y,x)-(F\cup \left\{e_1\right\}))$, and we denote by $G^{\prime }$ the graph formed from $G_1$ by further subdividing the edge $xy.$ Now, let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set, and let $F^{\prime }$ be the set of all subdivided edges of $G+e,$, except $xy$, such that their subdivision vertices belong to P. We denote by $G_2$ the graph formed from G by subdividing the edges of $F^{\prime }$. It is easy to check that, if $w_{xy}\notin P$ or $x,y\in P$, then, by Lemma 2,

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le \left|F\right|+2+\left|E\left(y\right)\right|\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2.$$
  Hence, we may assume that $w_{xy}\in D$ and $|P\cap \{x,y\left\}\right|=1$. As in the proof of Item 1, we can see that $w_{xy}$ is the unique subdivision vertex adjacent to x and y that belongs to P. To paired-dominate vertex $w_{y_1{y}_2}$, we may assume that $y_1\in P$. Now, if x and $w_{xy}$ are partners in P and $w\ne w_{xy}$ is a subdivision vertex adjacent to x, then $(P-\left\{w_{xy}\right\})\cup \left\{w\right\}$ is a PD-set of $G_3$ which is formed from G by subdividing the edges in $F\cup \left\{y_1{y}_2\right\}$, as well as the edges of $(E\left(y\right)-F\cup \left\{e_1\right\})\backslash (E(y,x)-F)$. It follows that ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_3\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. However, if y and $w_{xy}$ are partners in P, then, clearly, $N_G\left(x\right)\subseteq P$; thus, $P-\{y,w_{xy}\}$ is a PD-set of $G_2$, so ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G_2\right)>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$. In either case,

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+q_2(y,x)+2\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2.$$
• Let $t\in N\left(x\right)\cap N\left(y\right)$. If there is an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F such that $E\left(x\right)⊈F$ and $E\left(y\right)⊈F$, then $q_2(x,y)=2$, and, by Lemma 3, we have

  $${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+3\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2+min\{\Delta \left(G\right),max\{q_2(x,y),q_2(y,x)\}\}.$$
  Hence, we can assume that, for every ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F, $E\left(x\right)\subseteq F$ or $E\left(y\right)\subseteq F$. Clearly, in this case, $max\{q_2(x,y),q_2(x,y)\}\le \Delta \left(G\right)$. Now, let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set, such that, without loss of generality, $E\left(x\right)\subseteq F$. We denote by $G^{\prime }$ the graph formed from $G+xy$ by subdividing the edges of $F\cup \left\{xy\right\}\cup \left(E\right(y)-F)$. Let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set, and let $F^{\prime }$ be the set of all subdivided edges of $G+e,$ except $xy,$ in which subdivision vertices belong to $P.$ If $w_{xy}\notin P$ or $x,y\in P$, then, by Lemma 2, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le \left|F\right|+2+|E\left(y\right)-F|\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2+min\{\Delta \left(G\right),max\{q_2(x,y),q_2(y,x)\}\}$. Hence, we assume that $w_{xy}\in D$ and $|P\cap \{x,y\left\}\right|=1$. As in the proof of Item 1, we can see that $w_{xy}$ is the unique subdivision vertex adjacent to x and y that belongs to P. Then, clearly, $t\in P$ (to paired-dominate either $w_{xt}$ or $w_{yt})$, thus, $P-\{x,y,w_{xy}\}$ is a PD-set of the graph $G^{″}$ which is obtained from G by subdividing only the edges of $F^{\prime }.$ Consequently, ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}\left(G^{″}\right)\ge {\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$; hence,

  $$\begin{array}{ccc}\hfill {\mathrm{sd}}_{{\gamma }_{pr}}(G+e)& \le & \left|F^{\prime }\right|+1\hfill \\ & \le & \left|F\right|+\left|E\right(y)-F|+1\hfill \\ & \le & {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2+min\{\Delta \left(G\right),max\{q_2(x,y),q_2(y,x)\}\}.\hfill \end{array}$$
  The proof is completed.

□

3. Proof of Theorem 1

In this section, we prove Theorem 1.

Proof of Theorem 1.

We start by noting that since G is isolated-free and different from $m{K}_2,$$\Delta \left(G\right)\ge 2.$ Now, let $e=xy\notin E\left(G\right).$ If ${\gamma }_{pr}(G+e)<{\gamma }_{pr}\left(G\right),$ then, by Proposition 4${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$. Hence, we assume that ${\gamma }_{pr}(G+e)={\gamma }_{pr}\left(G\right)$. By Lemma 5-(3), we can assume that $N\left(x\right)\cap N\left(y\right)=\varnothing ,$ for, otherwise, the result is obviously valid. If $q_1(x,y)=0$, then x or y is support vertex; thus, the result follows by Lemma 4. Now, we consider two cases.

Case 1.$q_1(x,y)=1$.

Without loss of generality, assume that $1=q_1(x,y)=|N\left(v\right)\cap (V-N\left[x\right])|,$ where $v\in IS\left(x\right)$. Clearly, in this case v has degree two. Let z be the neighbor of v different from x. Moreover, let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set such that $q_2(x,y)$ is minimized. We can assume without loss of generality that $E\left(x\right)\subseteq F$ (otherwise, the result follows from Lemma 3). Let $F_1=F\cup E\left(y\right)$. Consider the graph $G^{\prime }={(G+e)}_{F_1\cup \{e,vz\}}$ and let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set, and let $F^{\prime }$ be a subset of F in which subdivision vertices are in P. According to Lemma 2, we can assume that $w_{xy}\in P$ and that $|P\cap \{x,y\left\}\right|=1$. As in the proof of item 1 of Lemma 5, one can see that $w_{xy}$ is the unique subdivision vertex adjacent to x and y that belongs to P.

First, let $x\in P$ and $y\notin P$. If $v\notin P$, then $w_{vz}\in P$; thus, the set $(P-\{w_{vz},w_{xy},x\})\cup \left\{v\right\}$ is a PD-set of the graph $G^{″}$ which is obtained from G by subdividing the edges of $F^{\prime }-\{e,vz\}.$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)\ge {\gamma }_{pr}\left(G^{″}\right)+2>{\gamma }_{pr}\left(G\right)={\gamma }_{pr}(G+e)$; thus, ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le \left|F_1\right|+2\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2.$ Now, if $v\in P$, then $w_{vz}$ is the partner of v in P; thus, the set $(P-\{w_{vz},w_{x,y}\}),$ in which v and x are partners, is a PD-set of the graph $G^{″}$ defined before, which leads to ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2$. Now, let $y\in P$ and $x\notin P$. Then, we must have $v,w_{vz}\in P$; thus, the set $(P-\{w_{xy},w_{vz},y\})\cup \left\{x\right\}$ is a PD-set of $G_1$ which is obtained from $G+e$ by subdividing the edges in $F^{\prime }-\left\{e\right\}$, yielding ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2$ as above.

Case 2.$q_1(x,y)\ge 2$.

Assume that there exists some ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F satisfying $E\left(x\right)⊈F$ and $E\left(y\right)⊈F$. By Lemma 3, the result follows. Hence, we assume that, for every ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set F, either $E\left(x\right)\subseteq F$ or $E\left(y\right)\subseteq F$. By Lemma 5-(3 and 1), we may assume that $N\left(x\right)\cap N\left(y\right)=\varnothing$ and either $N\left(x\right)$ or $N\left(y\right)$ is independent. Let z be a vertex in $IS\left(x\right)\cup IS\left(y\right)$ such that $q_1(x,y)=|N\left(z\right)\cap (V-N\left[x\right])|$ or $q_1(x,y)=|N\left(z\right)\cap (V-N\left[y\right])|$. Moreover, let F be an ${\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)$-set. We denote by $G^{\prime }$ the graph formed $G+xy$ by subdividing the edges of $F\cup \left\{xy\right\}\cup E\left(x\right)\cup E\left(y\right)\cup E\left(z\right)$. Note that since either $E\left(x\right)\subseteq F$ or $E\left(y\right)\subseteq F$, the number of subdivided edges is at most $\left|F\right|+2\Delta \left(G\right)$. Let P be a ${\gamma }_{pr}\left(G^{\prime }\right)$-set. Among all edges of G that have been subdivided resulting in the graph $G^{\prime }$, let $F^{\prime }$ be the set of those in which subdivision vertices are in P. If $w_{xy}\notin P$ or $x,y\in P$, then, clearly, the result follows from Lemma 2. Hence we may assume that $w_{xy}\in P$ and $|P\cap \{x,y\left\}\right|=1$. In addition, we assume, without loss of generality, that $x\in P$ and $y\notin P$.

By the similar method to the proof of Lemma 5-(1), we may assume that no subdivision vertex adjacent to x or y other than $w_{xy}$ belongs to P. Since $y\notin P$, we have $N_G\left(y\right)\subseteq P$. First, let $z\in N_G\left(y\right)$. Then, $z\in P$ and it has as a partner a subdivision vertex, say $w_{z{z}^{\prime }}$. In this case, one can easily see that the set $(P-\{x,w_{z{z}^{\prime }},w_{xy}\})\cup \left\{y\right\},$ in which y and z are partners, is a PD-set of the graph $G_2$ which is obtained from $G+e$ by subdividing all edges in $F^{\prime }-\{z{z}^{\prime },yz\}.$ It follows that ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}\left(G_2\right)\ge {\gamma }_{pr}(G+e)$. Now, let $z\in N\left(x\right)$. Then, P contains a subdivision vertex $w_{z{z}^{\prime }}$ that may have as a partner either z or $z^{\prime }.$ If $z\in P,$ then let $P^{\prime }=P-\{w_{z{z}^{\prime }},w_{x,y}\}$, and if $z^{\prime }\in P$, then let $P^{\prime }=\left\{z\right\}\cup P-\{w_{z{z}^{\prime }},w_{x,y}\}.$ Regardless the situation that occurs, $P^{\prime }$ is a PD-set of the graph $G_3$ which is obtained from $G+e$ by subdividing all edges in $F^{\prime }-\{z{z}^{\prime },xz\}$; thus, ${\gamma }_{pr}\left(G^{\prime }\right)>{\gamma }_{pr}(G+e)$ again. This completes the proof. □

4. Conclusions and Open Problems

In this paper, we considered the effect of subdivision of edges on the paired-domination number, that is, the paired-domination subdivision number of a graph. In particular, we proved that, for any isolated-free graph G different from $m{K}_2,$ if $e\notin E\left(G\right)$, then ${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+2\Delta \left(G\right)$. As a consequence of this study, we pose the following conjecture.

Conjecture 1.

For any isolated-free graph different from $m{K}_2$ and any $e\notin E\left(G\right)$,

$${\mathrm{sd}}_{{\gamma }_{pr}}(G+e)\le {\mathrm{sd}}_{{\gamma }_{pr}}\left(G\right)+\Delta \left(G\right)+2.$$

As a future work, we will focus on this problem.