17 citations · 18 across the 3 of their papers we have counts for
3 papers
math.CO2014
On Domination Number and Distance in Graphs
Cong X. Kang
A vertex set of a graph is a \emph{dominating set} if each vertex of either belongs to or is adjacent to a vertex in . The \emph{domination number} of …
math.CO2012★ 1 cited
On Zero Forcing Number of Functigraphs
Cong X. Kang, Eunjeong Yi
\emph{Zero forcing number}, , of a graph is the minimum cardinality of a set of black vertices (whereas vertices in are colored white) such that $V…
math.CO2012★ 17 cited
Probabilistic Zero Forcing in Graphs
Cong X. Kang, Eunjeong Yi
The \emph{zero forcing number} of a graph is the minimum cardinality of a set of black vertices (whereas vertices in $V(G)\setminusS$ are colored white) such that $V…