Definition:Connected (Graph Theory)/Graph/Disconnected

From ProofWiki
Jump to navigation Jump to search

Definition

Let $G$ be a graph.

Then $G$ is disconnected if and only if it is not connected.

That is, if there exists (at least) two vertices $u, v \in G$ such that $u$ and $v$ are not connected.


Sources