Definition:Connected (Graph Theory)/Vertices

Definition
Let $G$ be a graph.

Two vertices $u, v \in G$ are connected iff either:


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

Also see

 * Definition:Adjacent Vertices (Graph Theory)