A graph containing all possible edges is said to be a complete graph

Any subset of V where all vertices in the subset connect to all other vertices in the subset is called a clique

A complete graph is a clique of size |V|.