networking - Graph Theory: number of connected triples -
in order find global clustering coefficient need find number of connected triples. graph:
these triples found:
- 7-6-5
- 5-3-7
- 5-3-1
- 4-3-7
- 4-3-1
- 4-5-6
- 3-7-6
- 3-5-6
- 2-3-4
- 2-1-7
- 2-3-5
- 1-7-6
total: 12 triples.
moreover, there 3 triangles, , 1 triangle equal 3 triples. in total there 12 + 3*3 = 21 triples. correct? , possible find rule or method find connected triples in graph without doing manually?
Comments
Post a Comment