SlideServe
Menu
Préférences
© SlideServe · v2026

Representing Graphs and Graph Isomorphism

gen avatar
14 diapositives · 816 Views · Sep 05, 2012

Representing Graphs and Graph Isomorphism - slide 1
01 / 14Representing Graphs and Graph Isomorphism
1 / 17

Télécharger la présentation

Representing Graphs and Graph Isomorphism
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

    1. CSE 2813 Discrete Structures Representing Graphs and Graph Isomorphism Section 9.3

    2. CSE 2813 Discrete Structures A simple graph G = (V,E) with n vertices can be represented by its adjacency matrix, A, where the entry aij in row i and column j is Adjacency Matrix

    3. CSE 2813 Discrete Structures Adjacency Matrix Example

    4. CSE 2813 Discrete Structures Incidence Matrix Let G = (V,E) be an undirected graph. Suppose v1,v2,v3,…,vn are the vertices and e1,e2,e3,…,em are the edges of G. The incidence matrix w.r.t. this ordering of V and E is the n?m matrix M = [mij], where

    5. CSE 2813 Discrete Structures Incidence Matrix Example Represent the graph shown with an incidence matrix.

    6. CSE 2813 Discrete Structures Isomorphism Two simple graphs are isomorphic if there is a one-to one correspondence between the vertices of the two graphs the adjacency relationship is preserved

    7. CSE 2813 Discrete Structures Isomorphism (Cont ..) The simple graphs G1=(V1,E1) and G2=(V2,E2) are isomorphic if there is a one-to-one and onto function f from V1 to V2 with the property that a and b are adjacent in G1 iff f(a) and f(b) are adjacent in G2, for all a and b in V1.

    8. CSE 2813 Discrete Structures Example

    9. CSE 2813 Discrete Structures Invariants Invariants – properties that two simple graphs must have in common to be isomorphic Same number of vertices Same number of edges Degrees of corresponding vertices are the same If one is bipartite, the other must be; if one is complete, the other must be; and others …

    10. CSE 2813 Discrete Structures Example

    11. CSE 2813 Discrete Structures Example Are these two graphs are isomorphic?

    12. CSE 2813 Discrete Structures Example (Cont..) Start with the vertices of degree 2 since each graph only has one. deg(u3) = deg(v2) = 2 therefore f(u3) = v2 Then consider vertices of degree 3 deg(u1) = deg(u5) = deg(v1) = deg(v4) = 3 therefore we must have either one of f(u1) = v1 and f(u5) = v4 f(u1) = v4 and f(u5) = v1

    13. CSE 2813 Discrete Structures Example (Cont..) Now try vertices of degree 4 deg(u2) = deg(u4) = deg(v3) = deg(v5) = 4 therefore we must have either one of f(u2) = v3 and f(u4) = v5 f(u2) = v5 and f(u4) = v3 There are four possibilities (can be messy ) Try the first choices for f f(u1) = v1, f(u5) = v4, f(u2) = v3, f(u4) = v5 Determine the adjacency matrices of G and H

    14. CSE 2813 Discrete Structures Example (Cont..)