Complete Graph

Complete graphs are graphs that have all vertices adjacent to each other. That means that each node has a line connecting it to every other node in the graph.

Number of Edges
A complete graph K(n) has (n(n-1)/2) edges. So a graph with 5 nodes has 10 edges.