title: Graph Theory: number of connected triples
body: <p>In order to find the Global Clustering Coefficient I need to find the number of connected triples. About this <a href="https://i.stack.imgur.com/RYTbf.png" rel="nofollow noreferrer">graph</a>:</p>
  
  <p>these are the triples that I found:</p>
  
  <ol>
  <li>7-6-5 </li>
  <li>5-3-7</li>
  <li>5-3-1</li>
  <li>4-3-7</li>
  <li>4-3-1</li>
  <li>4-5-6</li>
  <li>3-7-6</li>
  <li>3-5-6</li>
  <li>2-3-4</li>
  <li>2-1-7</li>
  <li>2-3-5</li>
  <li>1-7-6</li>
  </ol>
  
  <p>total: 12 triples.</p>
  
  <p>Moreover, there are 3 triangles, and 1 triangle is equal to 3 triples. So in total there are 12 + 3*3 = 21 triples. Is that correct? And is it possible to find a rule or a method to find all the connected triples in a graph without doing it manually?</p>