Definition:Connected (Graph Theory)
From ProofWiki
This page is about connectedness in graph theory. For other uses, see Definition:Connected.
Contents
Definition
Vertices
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.
Graph
Let $G$ be a graph.
Then $G$ is connected if and only if every pair of vertices in $G$ is connected.