Connected / Disconnected

• Connected: A graph is considered connected if there exists a path from every vertex to every other vertex

• Disconnected: there exists a set of nodes that cannot be reached from some other set of nodes.