Scribd
Upload
25 views

Graph Part 2

The document defines a graph isomorphism as a bijection between the vertices of two graphs that preserves edges. Specifically, an isomorphism maps vertices to vertices such that two vertices are adjacent in the first graph if and only if their images are adjacent in the second graph. This means the graphs have the same structure or pattern of connections between vertices. Several examples of isomorphic and non-isomorphic graphs are provided. Necessary conditions for graph isomorphism include the graphs having the same number of vertices and edges, and the same degree sequence. Additional criteria related to vertex degrees and neighborhood structures are also discussed.

Uploaded by

Loudspeaker
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
25 views

Graph Part 2

The document defines a graph isomorphism as a bijection between the vertices of two graphs that preserves edges. Specifically, an isomorphism maps vertices to vertices such that two vertices are adjacent in the first graph if and only if their images are adjacent in the second graph. This means the graphs have the same structure or pattern of connections between vertices. Several examples of isomorphic and non-isomorphic graphs are provided. Necessary conditions for graph isomorphism include the graphs having the same number of vertices and edges, and the same degree sequence. Additional criteria related to vertex degrees and neighborhood structures are also discussed.

Uploaded by

Loudspeaker
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
You are on page 1/ 13

Definitions

Definition (isomorphism)
An isomorphism from a simple graph G to a simple graph H is a
bijection f : V (G ) → V (H) such that uv ∈ E (G ) if and only if
f (u)f (v ) ∈ E (H). We say that ”‘ G is isomorphic to H,”’ written
G∼ = H, if there is an isomorphism from G to H. For simplicity we
write f : G → H.
Example

2 / 14
Isomorphism Example

Example

3 / 14
Isomorphism Example

Example

4 / 14
Isomorphism Example

Example

5 / 14
Isomorphism Example

Example

6 / 14
Isomorphism test
Example

7 / 14
Test Isomorphism

Example

8 / 14
Tests for Non-isomorphism

The most basic necessary conditions for two graphs to be isomorphic:

1 Same number of vertices


2 Same number of edges
3 Same degree sequence
Additional necessary criteria for isomorphism
1 Let f : G → H be a graph isomorphism and let e ∈ E (G ).
Then the endpoints of edge f (e) have the same degrees as
the endpoints of e.
2 Let f : G → H be a graph isomorphism and let v ∈ V (G ).
Then the multiset of degrees of the neighbors of v equals the
multiset of degrees of the neighbors of f (v ).

9 / 14
Examples

10 / 14
Isomorphism using Adjacency matrices

11 / 14
Tests for Isomorphism

12 / 14
Isomorphism using Adjacency matrices

13 / 14
Isomorphism using Adjacency matrices

14 / 14

You might also like