Problem 56020. Easy Sequences 72: Complete Graph
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 commentsProblem Recent Solvers3
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
5934 Solvers
-
6142 Solvers
-
2845 Solvers
-
Back to basics 8 - Matrix Diagonals
910 Solvers
-
Find best placement for ordered dominoes (harder)
309 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!