31 citations · 143 across the 21 of their papers we have counts for
4 papers · 1 filter
Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
Linda Eroh, Cong X. Kang, Eunjeong Yi
Zero forcing number has recently become an interesting graph parameter studied in its own right since its introduction by the "AIM Minimum Rank -- Special Graphs Work Group", where…
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…
Total Domination Value in Graphs
Cong X. Kang
A set is a \emph{total dominating set} of if for every vertex there exists a vertex such that and are adjacent. A total domina…
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…