A graph is fully connected if there exists an edge between every possible pair of vertices.