31 citations · 143 across the 21 of their papers we have counts for
4 papers · 1 filter
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 …
A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
Linda Eroh, Cong X. Kang, Eunjeong Yi
The \emph{metric dimension} of a graph is the minimum number of vertices such that every vertex of is uniquely determined by its vector of distances to the chosen…
On Zero Forcing Number of Graphs and Their Complements
Linda Eroh, 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 are colored white) such tha…
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of 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 are colored white) such that i…