### isomorphic

«
1 / 10
»
1862, from iso- + Greek morphe (see Morpheus).
1. Two graphs are isomorphic if there is a correspondence between their vertex sets that preserves adjacency.

2. We may thereby compute the number of graphs which are isomorphic to their complements.

3. To show that two graphs are isomorphic one must indicate an isomorphism between them.

4. This paper introduces two types of benzenoid isomers with six isomorphic moieties.

5. Corporate Accounting Governance and Corporate Governance: Isomorphic, Imbedding, or Intersected?