Give the parent, queue, BFI (breadth first index), and level arrays when BFS is applied to this graph starting at vertex 0.
Process the neighbours of each vertex in numerical order.
1

Graph Isomorphism
The graph isomorphism problem has no known polynomial time algorithm which works for an arbitrary graph.
Canonical form : If two graphs are isomorphic, their canonical forms must be the same, otherwise, they must be different.
For trees and planar graphs, a canonical form can be computed in polynomial time.
2

Which graphs are isomorphic to graph B?
?
Petersen
Graph
?
?
3

4

5

6

Planar graphs: Isomorphic graphs can have planar embeddings that are not isomorphic.
7

Automorphism : Isomorphism from an object to itself. How many automorphisms does this embedding have?
8

9

The identity automorphism.
10

Flip over a horizontal axis.
11

Rotate 180º
12

Flip over the vertical axis.
13

Rotate 180º
Then flip over a horizonal axis.
14

The original embedding.
Identity automorphism:
Two line notation:
0 1 2 3 4 5
0 1 2 3 4 5
Cycle structure notation:
(0) (1)(2)(3)(4)(5)
15

Two line notation?
Cycle structure notation?
16

Two line notation:
0 1 2 3 4 5
0 1 5 4 3 2
Cycle structure notation:
(0)(1) (25)(34)
17

Two line notation?
Cycle structure notation?
18

Two line notation:
0 1 2 3 4 5
1 0 4 5 2 3
Cycle structure notation:
(01) (24)(35)
19

Two line notation?
Cycle structure notation?
20

Two line notation:
0 1 2 3 4 5
1 0 3 2 4 4
Cycle structure notation:
(01) (23)(45)
21

Permutations that are automorphisms: identity
(0)(1) (2)(3)(4)(5) horizontal flip
(0)(1)(25)(34) rotation
(01) (24)(35) vertical flip
(01) (23)(45)
22

The automorphism form a group:
1. The identity is always included.
2. If p is an automorphism, then so is p -1 .
3. If p and q are automorphisms, then so is p * q.
What is: rotate 180º horizonal flip
(01) (24)(35) * (0)(1)(25)(34)
23

The automorphism form a group:
1. The identity is always included.
2. If p is an automorphism, then so is p -1 .
3. If p and q are automorphisms, then so is p * q.
What is: rotation horizonal flip
(01)(24)(35) * (0)(1)(25)(34)
= (01)(23)(45) vertical flip
24

identity rotation vertical flip
Then flip over a horizonal axis.
25

Two graphs that are isomorphic but their embeddings are not:
26

27

Flipping this over:
28

If an embedding has an automorphism to its flip then the embedding is not chiral .
29

30

31

If an embedding has no automorphisms to its flip then the embedding is chiral .
Chiral embeddings have a sense of clickwise.
32

Clockwise_BFS(r, f, d):
1. Choose a root vertex r .
2. Choose a first child vertex f .
3. Choose a direction d (clockwise or countercloswise)
4. Do BFS subject to:
The children of each vertex are visited in the chosen order starting with f for the root or otherwise, starting with the BFS parent.
33

f r d
34

35

36

37

38

39

40