Scribd
Upload
8 views21 pages

08 Graph

Uploaded by

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

08 Graph

Uploaded by

rombux002
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 21

GRAPHS

CSE 2213 – Discrete Mathematics


Course teacher: Minhajul Bashir

10/20/2024 [email protected]
GRAPH ISOMORPHISM
A B A C

D C D B

We can draw the same graph differently


If we can determine that two graphs are actually two different
representations of the same graph, then they are called
isomorphic

10/20/2024 [email protected] 2
GRAPH ISOMORPHISM
A a

B b
A B a b
C c

D d
D C c d

Theoritically, two graphs are isomorphic if there is a one-to-one


and onto function from to (the sets of vertices) such that and
are adjacent in if and only if and are adjacent in , for all

10/20/2024 [email protected] 3
ARE THESE GRAPHS
ISOMORPHIC?

10/20/2024 [email protected] 4
DETERMINING
ISOMORPHISM
Determining isomorphism is a hard problem
 possible one-to-one correspondences between the vertex sets of two simple
graphs with vertices

But sometimes, you may find signs that can ensure that two graphs
are NOT isomorphic

10/20/2024 [email protected] 5
ARE THESE GRAPHS
ISOMORPHIC?

10/20/2024 [email protected] 6
DISPROVING ISOMORPHISM:
GRAPH INVARIANTS
Signs that can ensure that two graphs are NOT isom
Graph invariants are certain properties of a graph that are
preserved by isomorphism
Example: number of vertices, number of edges etc.

10/20/2024 [email protected] 7
ARE THESE GRAPHS
ISOMORPHIC?

Number of vertices different

10/20/2024 [email protected] 8
ARE THESE GRAPHS
ISOMORPHIC?

Number of edges different

10/20/2024 [email protected] 9
ARE THESE GRAPHS
ISOMORPHIC?

Graph : Degree sequence is 3, 3, 2, 2, 2 (Maximum degree 3)


Graph : Degree sequence is 4, 3, 2, 2, 1 ( has degree 4)

10/20/2024 [email protected] 10
DEGREE SEQUENCE
The degree sequence of a graph is the
sequence of the degrees of its vertices
in non-increasing order
The degree sequence of the given graph
is 3, 3, 3, 3, 2, 2

10/20/2024 [email protected] 11
GRAPH INVARIANTS
Number of vertices
Number of edges
Degree sequence

10/20/2024 [email protected] 12
ARE THESE GRAPHS
ISOMORPHIC?

😡😡😡😡😡😡😡😡

10/20/2024 [email protected] 13
CYCLE LENGTH AS GRAPH
INVARIANT

Graph does not have any simple cycle of length 3.


Graph has two simple cycles of length 3.

10/20/2024 [email protected] 14
GRAPH INVARIANTS
Many more invariants are out there
Many invariants are yet to discover
So even if you see that all the three invariants are same in the two
graphs, it does not guarantee isomorphism

10/20/2024 [email protected] 15
PROBLEM

Find out if the graphs and are isomorphic. If yes, show a vertex
mapping from to . If not, show appropriate reasons.

10/20/2024 [email protected] 16
MISCELLANEOUS
EXAMPLES

10/20/2024 [email protected]
EXERCISE
Show that in a simple graph with at least two vertices, there
must be at least two vertices with the same degree.

10/20/2024 [email protected] 18
Show that in a simple graph with at least two vertices,
there must be two vertices with the same degree.

1. Since the graph is simple, the possible values of the degrees


is to .
2. Note that a graph cannot have vertices of degrees both and
(why?)
3. So the possible values of degrees is either to , or to
4. Since there are possible degrees for vertices, by pigeonhole
principle, two of them must have the same degree

10/20/2024 [email protected] 19
EXERCISE
How many paths of length 4 are there from to in the
following graph?

10/20/2024 [email protected] 20
Adjacency matrix representation of this graph:
(ordering: )

The number of paths of length 4 from to is the (1, 4) entry of .

Therefore, there are 8 paths of length 4 from to .

10/20/2024 [email protected] 21

You might also like