Assertion: disconnected graph | /r/MadeOf | the disjoint union of graphs
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.