A graph is ______ if it has at least one pair of vertices without a path between them.
A)complete
B)disconnected
C)connected
D)full

Question

Quizplus · Accepted Answer

A disconnected graph means that there is at least one pair of vertices that cannot be reached from each other, indicating the absence of a path between them. Complete graphs are those in which all pairs of vertices are connected by edges, while connected graphs indicate that there is a path between any two vertices of the graph. The term "full" is not typically used to describe graphs.

A Graph Is ______ If It Has at Least One