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.
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers5
Suggested Problems
-
6465 Solvers
-
1718 Solvers
-
How long is the longest prime diagonal?
415 Solvers
-
Replace multiples of 5 with NaN
472 Solvers
-
Tony's trick for duplicating an mx1 vector n times
59 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!