Of NotesClustering coefficient via triangle counts1 min read · revised 19 October 2026 · cover · copy mark Table of Contents Problem Solution Problem Show that in any simple non-directed graph with adjacency matrix , for all nodes with , where is the number of triangles node takes part in. Solution Closed 3-walks from through distinct : Each triangle is walked in both directions: so it is counted twice: