How to justify the statement that a graph is connected?

602 Views Asked by At

Is the graph connected? Justify.

Because there is a path connecting all pairs of vertices, this graph is therefore connected?

Is that right?

graph

1

There are 1 best solutions below

0
On

If it were disconnected, you could find two vertices with no path between them. But every vertex is incident to every other vertex, so that isn't possible.