answersLogoWhite

0

The number of triangles in a complete graph with n nodes is

n*(n-1)*(n-2) / 6.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How many perfect matchings are there in a complete graph of 6 vertices?

15


Is the complete graph on 5 vertices planar?

No, the complete graph of 5 vertices is non planar. because we cant make any such complete graph which draw without cross over the edges . if there exist any crossing with respect to edges then the graph is non planar.Note:- a graph which contain minimum one edge from one vertex to another is called as complete graph...


What is triangles complete degrees?

180 degrees


How do you complete level 15 on Shrink It?

You have to shrink the triangles, grow the block, grow the triangles, grow the octagon.


How many Hamiltonian circuits not counting reversals are there in a complete graph with 7 vertices?

In a complete graph with ( n ) vertices, the number of distinct Hamiltonian circuits, not counting reversals, is given by ( \frac{(n-1)!}{2} ). For a complete graph with 7 vertices, this calculation is ( \frac{(7-1)!}{2} = \frac{6!}{2} = \frac{720}{2} = 360 ). Therefore, there are 360 distinct Hamiltonian circuits in a complete graph with 7 vertices when not considering reversals.


How do you complete a circle graph?

you fill it in


Is finding the longest path in a graph an NP-complete problem?

Yes, finding the longest path in a graph is an NP-complete problem.


How many triangles are in 1 triangles?

there are 27 triangles in a triangle


How many triangles are their in a 17 gon?

There are 15 triangles in a 17-agon


How many triangles are in a dodecagon?

15 triangles!!!!!!!!!!


How many triangles can you find in a square?

no triangles


How many triangles on the Australian flag?

There are no triangles.