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 Solvers3
Suggested Problems
-
46919 Solvers
-
4786 Solvers
-
3038 Solvers
-
Project Euler: Problem 9, Pythagorean numbers
1386 Solvers
-
Remove from a 2-D matrix all the rows that contain at least one element less than or equal to 4
139 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!
