A complete graph is an undirected graph on n nodes such that every node is connected to every other node. Say you remove an edge from a complete graph on n nodes. What is the new clustering coefficient (C)? Assume that n>=3.
I get:
C = 1 - 6/(n*(n-1)) (wrong!)
0 answers