Given the following graph:
What's the term to describe the fact that vertices 1, 2, and 5 are all mutually connected to one another (as in 1 is connected to 2 and 5, 2 is connected to 1 and 5, etc.)? I'm trying to lookup algorithms to determine when a given set of vertices are all connected to each other (not via other vertices, but with direct connections).