Zhuang Wei

activity

20182021

collaborators

3 papers

math.CO2021

Double domination in maximal outerplanar graphs

Wei Zhuang

In a graph $G$ , a vertex dominates itself and its neighbors. A subset $S \subseteq V (G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least t…

math.CO2020

A note on semitotal domination in graphs

Wei Zhuang

A set $S$ of vertices in $G$ is a semitotal dominating set of $G$ if it is a dominating set of $G$ and every vertex in $S$ is within distance $2$ of another vertex of $S$ . The \emp…

math.CO2018

Disjunctive domination in trees

Wei Zhuang

In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the domination number. Given the sheer scale of modern networks…