Graph Isomorphic Relation

A Graph Isomorphic Relation is a Binary Relation between two Graphs (G₁,G₂) that tests whether a graph isomorphism mapping exists from one (G₁) to the other (G₂).

• • …
• Counter-Example(s):
  • a Graph Isomophism Mapping.
• See: Graph Equivalence Relation, Graph Isomorphism Task, Graph Edit Distance Function, Graph-Minor Relation.

---

---

References

2009

• http://www2.parc.com/istl/groups/hdi/sensemaking/glossary.htm
  • subgraph equivalence: Two subgraphs are equivalent if there is a mapping such that (1) for every node in the first subgraph there is a corresponding node in the second subgraph, (2) for every link in the first subgraph between two nodes there is a link of the same kind (or label) between the corresponding nodes of the second subgraph, and (3) for some meaning assigned to a node in the first subgraph, the same meaning is associated with the corresponding node in the second subgraph.

---