Assertion: graph's dual | /r/HasProperty | isomorphic
Facets:
value: to the primal graph
type: OTHER
value: strongly
type: DEGREE
Source sentences:
text: In this example, H {\displaystyle H} and G {\displaystyle G} are equivalent, H ≡ G {\displaystyle H\equiv G} , and the duals are strongly isomorphic: H ∗ ≅ G ∗ {\displaystyle H^{*}\cong
text: They are self-dual: the planar dual of any wheel graph is an isomorphic graph.
text: Because the dual of the dual of a connected plane graph is isomorphic to the primal graph, each of these pairings is bidirectional: if concept X in a planar graph corresponds to concept Y in the dual graph, then concept