Scribd
Upload
534 views17 pages

Lecture Notes 19 (Isomorphism)

The document discusses graph theory and isomorphism. It defines isomorphism as a bijective function between the vertex sets of two graphs that preserves edges. An example shows two graphs that are isomorphic by exhibiting such a function. Visualizations help understand that isomorphic graphs have the same structure.

Uploaded by

arsenic_94
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Topics covered

  • Graph Theory Exercises,
  • Graph Representation,
  • Graph Theory History,
  • Exercise,
  • Proof,
  • Isomorphism,
  • Graph Theory Trends,
  • Mapping,
  • Graph Theory Visualization,
  • Graphs
534 views17 pages

Lecture Notes 19 (Isomorphism)

The document discusses graph theory and isomorphism. It defines isomorphism as a bijective function between the vertex sets of two graphs that preserves edges. An example shows two graphs that are isomorphic by exhibiting such a function. Visualizations help understand that isomorphic graphs have the same structure.

Uploaded by

arsenic_94
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Topics covered

  • Graph Theory Exercises,
  • Graph Representation,
  • Graph Theory History,
  • Exercise,
  • Proof,
  • Isomorphism,
  • Graph Theory Trends,
  • Mapping,
  • Graph Theory Visualization,
  • Graphs
  • Cover Page
  • Definition of Isomorphism
  • Isomorphism Exercise
  • Visualization Method
  • Conclusion Observation

GRAPH THEORY

ISOMORPHISM
Definition. Let 1 = (1 , 1 ) and 2 = (2 , 2 ) be graphs.
The graphs 1 and 2 are isomorphic if there exists a
bijective function : 1 2 such that (, ) 1 if and only
if ( , ) 2 . The function is called an isomorphism
1 2 1 2
11
: 2 4
32
4 3 4 3 43
1 2
Exercise. Prove that the graphs below are isomorphic by
finding an isomorphism.
1
2
6


5 3

4
Here is a good way of visualizing isomorphism:

1
2
6


5 3

4
Here is a good way of visualizing isomorphism:

1
2
6


5 3


4
Here is a good way of visualizing isomorphism:

1

6
2

5 3


4
Here is a good way of visualizing isomorphism:

1

6
2

5 3


4
Here is a good way of visualizing isomorphism:

1

6


5 3


4 2
Here is a good way of visualizing isomorphism:


1

6


5 3


4 2
Here is a good way of visualizing isomorphism:


1

6

5 3


4 2
Here is a good way of visualizing isomorphism:


1

6

5 3


4 2
Here is a good way of visualizing isomorphism:


1

6

5 3


4 2
Here is a good way of visualizing isomorphism:

1


6

5 3


4 2
Here is a good way of visualizing isomorphism:

5 3

4 2
Here is a good way of visualizing isomorphism:

5 3

4 2
Here is a good way of visualizing isomorphism:

5 3

4 2
Can you now see the similarity in structures of the graphs?

5 3

4 2

You might also like