8 citations · 12 across the 5 of their papers we have counts for
12 papers · 1 filter
On the Average (Edge-)Connectivity of Minimally -(Edge-)Connected Graphs
Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal
Let be a graph of order and let be vertices of . Let denote the maximum number of internally disjoint - paths in . Then the average connectivit…
The Threshold Strong Dimension of a Graph
Nadia Benakli, Novi H Bong, Shonda M. Dueck +3
Let be a connected graph and and vertices of . Then is said to {\em strongly resolve} and , if there is either a shortest - path that contains …
Enumerating the Digitally Convex Sets of Powers of Cycles and Cartesian Products of Paths and Complete Graphs
MacKenzie Carr, Christina M. Mynhardt, Ortrud R. Oellermann
Given a finite set , a convexity , is a collection of subsets of that contains both the empty set and the set and is closed under intersections. The element…
The Threshold Dimension and Irreducible Graphs
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
Let be a graph, and let , , and be vertices of . If the distance between and does not equal the distance between and , then is said to resolve $…
The Threshold Dimension of a Graph
Lucas Mol, Matthew J. H. Murphy, Ortrud R. Oellermann
Let be a graph, and let , , and be vertices of . If the distance between and does not equal the distance between and , then is said to resolve $…
The maximum average connectivity among all orientations of a graph
Rocio M. Casablanca, Peter Dankelmann, Wayne Goddard +2
For distinct vertices and in a graph , the {\em connectivity} between and , denoted , is the maximum number of internally disjoint -- paths in …