networking - Graph Theory: number of connected triples -


in order find global clustering coefficient need find number of connected triples. graph:

these triples found:

  1. 7-6-5
  2. 5-3-7
  3. 5-3-1
  4. 4-3-7
  5. 4-3-1
  6. 4-5-6
  7. 3-7-6
  8. 3-5-6
  9. 2-3-4
  10. 2-1-7
  11. 2-3-5
  12. 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

Popular posts from this blog

How to understand 2 main() functions after using uftrace to profile the C++ program? -

c# - Update a combobox from a presenter (MVP) -

How to put a lock and transaction on table using spring 4 or above using jdbcTemplate and annotations like @Transactional? -