Page "Connectivity (graph theory)" Paragraph 1

In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected.

If the two vertices are additionally connected by a path of length 1, i. e. by a single edge, the vertices are called adjacent.

A graph is said to be connected if every pair of vertices in the graph is connected.