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
-
The Goldbach Conjecture, Part 2
2417 Solvers
-
1933 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
3713 Solvers
-
139 Solvers
-
Edges of a n-dimensional Hypercube
89 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!
