Is the graph connected? Justify.
Because there is a path connecting all pairs of vertices, this graph is therefore connected?
Is that right?

Is the graph connected? Justify.
Because there is a path connecting all pairs of vertices, this graph is therefore connected?
Is that right?

Copyright © 2021 JogjaFile Inc.
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.