3
$\begingroup$

Given a simple connected graph $G(V,E)$, is there any relation between the clustering coefficent $C_c = {2|E|\over|V|(|V|-1)}$ of a graph and the length of a all pairs shortest path?

Thank you very much!

  • 0
    yes srivatsan, your is probably very close to the answer. I would like to know, any, if exist possible relation between these two elements2011-09-11

0 Answers 0