☆5.2.2 Connectivit %s 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❖5.2.2 Connectivity ❖ 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