How is a graph where every node is connected to every other node denoted? [closed]

StackOverflow https://stackoverflow.com/questions/530674

Question

How is a graph where every node is connected to every other node (without redundant connections) called?

I know that this graph has N * (N - 1) / 2 edges.

Was it helpful?

Solution

Complete Graph

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top