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 Solvers5
Suggested Problems
-
1073 Solvers
-
Compute a dot product of two vectors x and y
1057 Solvers
-
Magic is simple (for beginners)
11724 Solvers
-
I've got the power! (Inspired by Project Euler problem 29)
148 Solvers
-
Diophantine Equations (Inspired by Project Euler, problem 66)
73 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!
