Lucas Mol

most citedOn the Average (Edge-)Connectivity of Minimally

k

-(Edge-)Connected Graphs

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2021★ 2 cited

On the Average (Edge-)Connectivity of Minimally $k$ -(Edge-)Connected Graphs

Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal

Let $G$ be a graph of order $n$ and let $u, v$ be vertices of $G$ . Let $κ_{G} (u, v)$ denote the maximum number of internally disjoint $u$ - $v$ paths in $G$ . Then the average connectivit…

math.CO2018

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs

Rocío M. Casablanca, Lucas Mol, Ortrud R. Oellermann

Let $G$ be a (multi)graph of order $n$ and let $u, v$ be vertices of $G$ . The maximum number of internally disjoint $u$ - $v$ paths in $G$ is denoted by $κ_{G} (u, v)$ , and the maximum nu…

On the Average (Edge-)Connectivity of Minimally k-(Edge-)Connected Graphs

Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs

On the Average (Edge-)Connectivity of Minimally $k$ -(Edge-)Connected Graphs