>
|
|
An undirected graph example (G1 and G3 are isomorphic).
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
>
|
|
>
|
|
| (6) |
A directed graph example (D1 and D3 are isomorphic).
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
| (9) |
>
|
|
>
|
|
>
|
|
| (12) |
Create isomorphic permutation of Petersen graph, and check
>
|
|
| (13) |
| (14) |
>
|
|
| (16) |
Apply permutation to permuted graph to obtain original Petersen graph and compare adjacency matrices
>
|
|
| (17) |
>
|
|