A graph $X$ is connected if there is an edge path connecting every vertex of $X$ to every other.
Wikidata ID: Q230655