Answer:
A graph is disconnected if at least two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected subgraph of G is called a connected component of the graph.
Step-by-step explanation:
hope It helped you
Author:
faustodunn
Rate an answer:
6