Linda Eroh

collaborators

2 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.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…