# Connected (graph)

Last edited: 2023-11-11

A graph $G = (V, E)$ is considered connected if for all vertices $x,y \in V$ there exists a path $\{v_i\}_{i=1}^k$ such that $v_1 = x$ and $v_k = y$.