Assertion: graph's g | /r/HasProperty | isomorphic
Facets:
value: with ϕ
type: OTHER
value: clearly
type: MANNER
Source sentences:
text: Then clearly H {\displaystyle H} and G {\displaystyle G} are isomorphic (with ϕ ( a ) =
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.