3 citations · 5 across the 4 of their papers we have counts for
1 paper · 2 filters
Siham Bekkai, Mekkia Kouider
We bound the mean distance in a connected graph which is not a tree in function of its order n and its girth g. On one hand, we show that mean distance is at most $\frac{n+1}{3…