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
-
6780 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
531 Solvers
-
Make a random, non-repeating vector.
8750 Solvers
-
Given a window, how many subsets of a vector sum positive
850 Solvers
-
23 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!