Assertion: graph's automorphism | /r/CapableOf | swap the two components
Facets:
Source sentences:
text: For, G and H are isomorphic if and only if the disconnected graph formed by the disjoint union of graphs G and H has an automorphism that swaps the two components.