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 Solvers5
Suggested Problems
-
3450 Solvers
-
Count from 0 to N^M in base N.
241 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
653 Solvers
-
Duplicate each element of a vector.
639 Solvers
-
447 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!
