A graph is disconnected if there exists two vertices in such that no edge in has these vertices as endpoint. The opposite of a Connected Graph.