Question

Suppose G and H are isomorphic graphs. Find the number of connected components of H if G has 8 connected components.?​

Answer 1

Answer:

We often only consider only simple graphs. ... Two graphs G and H are isomorphic if there is a bijection f : V (G) → V (H) so that, for any v, w ∈ V (G), the number of edges connecting v to w is the same as the number of edges connecting f(v) to f(w). Note that we do not assume that v = w in the definition.08-Sept-2005