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)\leq \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 vertices and edges of $G$.
Alikhani, S., & Ghanbari, N. (2023). Strong domination number of a modified graph. AUT Journal of Mathematics and Computing, (), -. doi: 10.22060/ajmc.2023.22327.1152
MLA
Saeid Alikhani; Nima Ghanbari. "Strong domination number of a modified graph". AUT Journal of Mathematics and Computing, , , 2023, -. doi: 10.22060/ajmc.2023.22327.1152
HARVARD
Alikhani, S., Ghanbari, N. (2023). 'Strong domination number of a modified graph', AUT Journal of Mathematics and Computing, (), pp. -. doi: 10.22060/ajmc.2023.22327.1152
VANCOUVER
Alikhani, S., Ghanbari, N. Strong domination number of a modified graph. AUT Journal of Mathematics and Computing, 2023; (): -. doi: 10.22060/ajmc.2023.22327.1152