## Testing Layouts

π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?

## Answer

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?

## Answer

β οΈ No. See, for example:

*This example is by Gerry Myerson from Math.SE.