Definition:Connected (Graph Theory)/Vertices
< Definition:Connected (Graph Theory)(Redirected from Definition:Connected Nodes)
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
- Results about connectedness in the context of graph theory can be found here.
Sources
- 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): $\S 2.3$: Connected Graphs