Strong domination number of a modified graph

Abstract

Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a strong dominating set of $G$, if for every vertex $x\in V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\le deg(y)$. The strong domination number ${\gamma }_{st}(G)$ is defined as the minimum cardinality of a strong dominating set. In this paper, we study the effects on ${\gamma }_{st}(G)$ when $G$ is modified by operations on vertex and edge of $G$.

8 pages, 5 figures. arXiv admin note: text overlap with arXiv:2210.11120