Linda Eroh

activity

20112020

most citedA Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs

28 citations · 68 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2020

The Threshold Strong Dimension of a Graph

Nadia Benakli, Novi H Bong, Shonda M. Dueck +3

Let $G$ be a connected graph and $u, v$ and $w$ vertices of $G$ . Then $w$ is said to {\em strongly resolve} $u$ and $v$ , if there is either a shortest $u$ - $w$ path that contains $v$ …

math.CO2018★ 17 cited

The connected metric dimension at a vertex of a graph

Linda Eroh, Cong X. Kang, Eunjeong Yi

The notion of metric dimension, $d im (G)$ , of a graph $G$ , as well as a number of variants, is now well studied. In this paper, we begin a local analysis of this notion by introduci…

math.CO2015

A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs

Linda Eroh, Henry Escuardo, Ralucca Gera +2

Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by th…

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.CO2012★ 7 cited

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…

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★ 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)…