In Graph Theory, we say a graph is a Complete Graph, if all of its nodes are connected to evey other nodes in the graph. Examples of complete graphs are shown below.
In this problem we are asked to calculate 
, which is the number of connections of a complete graph with n nodes.
, which is the number of connections of a complete graph with n nodes.Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers4
Suggested Problems
-
Sum of first n terms of a harmonic progression
520 Solvers
-
505 Solvers
-
How many days does the cat take to climb out of the hole?
83 Solvers
-
427 Solvers
-
poll: would you like the regexp (?@cmd) functionality to be banned in Cody?
182 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
