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 Solvers3
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
253 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2536 Solvers
-
823 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
253 Solvers
-
38 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!
