Definition:Connected (Graph Theory)/Vertices

From ProofWiki
Jump to navigation Jump to search

Definition

Let $G$ be a graph.

Two vertices $u, v \in G$ are connected if and only if either:

$(1): \quad u = v$
$(2): \quad u \ne v$, and there exists a walk between them.


Also see


Sources