Eunjeong Yi

activity

20112024

most citedIteration Index of a Zero Forcing Set in a Graph

31 citations · 157 across the 25 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

math.CO2014★ 28 cited

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} $dim (G)$ of a graph $G$ is the minimum number of vertices such that every vertex of $G$ is uniquely determined by its vector of distances to the chosen…

math.CO2014★ 6 cited

On Zero Forcing Number of Graphs and Their Complements

Linda Eroh, Cong X. Kang, Eunjeong Yi

The \emph{zero forcing number}, $Z (G)$ , of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V (G) ∖ S$ are colored white) such tha…

math.CO2014

A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs

Cong X. Kang, Eunjeong Yi

The \emph{zero forcing number}, $Z (G)$ , of a graph $G$ is the minimum cardinality of a set $S$ of black vertices (whereas vertices in $V (G) - S$ are colored white) such that $V (G)$ i…