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 Solvers3
Suggested Problems
-
Project Euler: Problem 1, Multiples of 3 and 5
3673 Solvers
-
393 Solvers
-
How long is the longest prime diagonal?
410 Solvers
-
425 Solvers
-
poll: would you like the regexp (?@cmd) functionality to be banned in Cody?
181 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!