2 citations · 2 across the 1 of their papers we have counts for
1 paper
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…