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
-
9160 Solvers
-
Matrix with different incremental runs
131 Solvers
-
USC Fall 2012 ACM : Code Word Minimum Flipped Bits
19 Solvers
-
Fermat's Last Theorem - Fermat's conjecture
109 Solvers
-
Minimum Distance between two N-sided Polygons
27 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!
