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 2011 · math.COShow all

5 papers · 2 filters

math.CO2011★ 8 cited

On Metric Dimension of Functigraphs

Linda Eroh, Cong X. Kang, Eunjeong Yi

The \emph{metric dimension} of a graph $G$ , denoted by $dim (G)$ , is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vert…

math.CO2011★ 3 cited

Domination Value in Graphs

Eunjeong Yi

A set $D \subseteq V (G)$ is a \emph{dominating set} of $G$ if every vertex not in $D$ is adjacent to at least one vertex in $D$ . A dominating set of $G$ of minimum cardinality is c…

math.CO2011

Domination Value in $P_{2} □ P_{n}$ and $P_{2} □ C_{n}$

Eunjeong Yi

A set $D \subseteq V (G)$ is a \emph{dominating set} of a graph $G$ if every vertex of $G$ not in $D$ is adjacent to at least one vertex in $D$ . A \emph{minimum dominating set} of $…

math.CO2011★ 2 cited

Domination in Functigraphs

Linda Eroh, Ralucca Gera, Cong X. Kang +2

Let $G_{1}$ and $G_{2}$ be disjoint copies of a graph $G$ , and let $f : V (G_{1}) \to V (G_{2})$ be a function. Then a \emph{functigraph} $C (G, f) = (V, E)$ has the vertex set $V=V(G_1)…

math.CO2011★ 31 cited

Iteration Index of a Zero Forcing Set in a Graph

Kiran B. Chilakamarri, Nathaniel Dean, Cong X. Kang +1

Let each vertex of a graph G = (V(G), E(G)) be given one of two colors, say, "black" and "white". Let Z denote the (initial) set of black vertices of G. The color-change rule conve…

On Metric Dimension of Functigraphs

Domination Value in Graphs

Domination Value in P2​□Pn​ and P2​□Cn​

Domination in Functigraphs

Iteration Index of a Zero Forcing Set in a Graph

Domination Value in $P_{2} □ P_{n}$ and $P_{2} □ C_{n}$