a component of a graph is a maximal subset of vertices such that there exists at least one path from every vertex of the subgraph to another. suppose that a graph has 3 components. how will its adjacency matrix look like?



Answer :