Disconnected Graphs

Home > Mathematics > Graph theory > Paths and cycles > Disconnected Graphs

A graph is said to be disconnected if it has two or more connected components, meaning that there are two or more sets of vertices that are not connected to each other.