Weisheng Zhao

most citedThe Bondage Number of the Strong Product of a Complete Graph and a Path

4 citations · 4 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2022

The Existence of Graph whose Vertex Set Can be Partitioned into a Fixed Number of Domination Strong Critical Vertex-sets

Weisheng Zhao, Ying Li, Ruizhi Lin

Let $γ (G)$ denote the domination number of a graph $G$ . A vertex $v \in V (G)$ is called a \emph{critical vertex} of $G$ if $γ (G - v) = γ (G) - 1$ . A graph is called \emph{vertex-critical}…

math.CO2013★ 4 cited

The Bondage Number of the Strong Product of a Complete Graph and a Path

Weisheng Zhao, Heping Zhang

The bondage number $b (G)$ of a graph $G$ is the cardinality of a minimum edge set whose removal from $G$ results in a graph with the domination number greater than that of $G$ . It…