Connected Graphs

An undirected graph is connected provided every pair of vertices has some path in the graph that begins at one and ends at the other.

c

d

a

b

Is this graph connected?

Previous slide

Next slide

Back to first slide

View graphic version