Definition 15: A graph is called connectivity if there is a path between every pair of distinct vertices of the graph. Otherwise, the graph is disconnected &A graph that is not connected is the union of two or more connected subgraphS, each pair of which has no vertex in common. These disjoint connected subgraphs are called the connected components of the graph❖ Definition 15: A graph is called connectivity if there is a path between every pair of distinct vertices of the graph. Otherwise , the graph is disconnected. ❖ A graph that is not connected is the union of two or more connected subgraphs, each pair of which has no vertex in common. These disjoint connected subgraphs are called the connected components of the graph