🛠 Graph Isomorphism. Graphs and are said to be isomorphic if there is a map such that is an edge in if and only if is an edge in .
Examples of isomoprhic graphs (from Wikipedia):
🤔 Which of the two graphs below are isomorphic?
and are isomorphic. does not have a matching degree sequence and is therefore not isomorphic to either of them.
🤔 Are matching degree sequences enough to guarantee isomorphism?
⚠️ No. See, for example:
*This example is by Gerry Myerson from Math.SE.