0 like 0 dislike
8 views
What is Connectedness in graph theory?
| 8 views

0 like 0 dislike
A graph G is connected if $\forall x, y \in V(G)$ there is a path from x to y.

Theorem:
Let G be a graph and let $v \in V(G)$. If $\forall w \in V(G)$ there is a path from v to w in G, then G is connected.
by Diamond (40.2k points)