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 Solvers4
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6806 Solvers
-
Return the 3n+1 sequence for n
8512 Solvers
-
Convert hex color specification to MATLAB RGB
259 Solvers
-
Find and replaces spaces from a input string with *
172 Solvers
-
Factorial: Unlimited Size : java.math
49 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!