Complete graph

A complete graph is a graph where any one node has a connection to all other nodes.

This results in the degree of any one node being equal to the total amount of nodes minus one.

$$Deg(N[k])=|N|-1,\forall k\in \mathbf{N}$$