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
-
Find the longest sequence of 1's in a binary sequence.
6850 Solvers
-
2194 Solvers
-
Program an exclusive OR operation with logical operators
803 Solvers
-
The Answer to Life, the Universe, and Everything
588 Solvers
-
1700 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!