Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098)

Let \(G\) be a graph and \(u\) and \(v\) two distinct vertices of \(G\). By \(G_{u,v,k-2}\) one denotes a graph obtained from \(G\) by adding a path \(ux_1x_2\dots x_{k-2}v\) of length \(k\) between \(u\) and \(v\). Set \(D\subseteq V(G)\) is a dominating set of \(G\) if every vertex from \(V(G)-D\) has a neighbor in \(D\). The domination number \(\gamma(G)\) is the minimum cardinality of a dominating set of \(G\). The present work is a study of the relation between \(\gamma(G)\) and \(\gamma(G_{u,v,k})\) for different \(k\). The minimum and maximum number \(k\) for which \(\gamma(G)<\gamma(G_{u,v,k})\) for arbitrary (adjacent or nonadjacent) \(u\) and \(v\) is also considered.