9.3: Representing Graphs and Graph Isomorphism. Graphs, Edge tables, and adjacency matrices a bababab cdcdcdc edge lists Vertex adjacency vertexinitial.

Slides:

Advertisements

Similar presentations

CSE 211 Discrete Mathematics

Advertisements

Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.

9.7 Planar Graphs. Intro problem- 3 houses and 3 utilities K 3,3 problem: Can 3 houses be connected to 3 utilities so that no 2 lines cross? Similarly,

Introduction to Line Graphs Emphasizing their construction, clique decompositions, and regularity.

Applied Discrete Mathematics Week 12: Trees

On the Hardness of Graph Isomorphism Jacobo Tor á n SIAM J. Comput. Vol 33, p , Presenter: Qingwu Yang April, 2006.

Interconnection Networks Lecture 3: Topologies Jan. 17 th, 2007 Prof. Chung-Kuan Cheng Transcribed by: Mohammad Al-Fares.

1/25/2005Tucker, Sec Applied Combinatorics, 4th Ed. Alan Tucker Section 1.2 Isomorphism Prepared by Jo Ellis-Monaghan.

1.1. Graph Models Two basic notions: Graphs Directed Graphs.

ARCHEOLOGICAL SERIATION AND INTERVAL GRAPHS

Section 1.2 Isomorphisms By Christina Touhey and Sarah Graham.

KNURE, Software department, Ph , N.V. Bilous Faculty of computer sciences Software department, KNURE Discrete.

9.3 Representing Graphs and Graph Isomorphism

Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.

Let us switch to a new topic:

MCA 520: Graph Theory Instructor Neelima Gupta

 期中测验时间：  11 月 4 日  课件集合，关系，函数，基数, 组合数学.  Ⅰ Introduction to Set Theory  1. Sets and Subsets  Representation of set:  Listing elements, Set builder.

Functions Functions. A function is a rule that relates two quantities so that each input value corresponds to exactly one output value. Define-

Graphs context: functions context: graphs and networks.

© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)

aka “Undirected Graphs”

9.2: Graph Terminology. Special Simple Graphs Complete GraphsK 1,… CyclesC 3,… WheelsW 3,… N-cubesQ 1,… Complete bipartiteK 2,2,…

1 CS104 : Discrete Structures Chapter V Graph Theory.

Based on slides by Y. Peng University of Maryland

Graph pattern matching Graph GGraph Qisomorphism f(a) = 1 f(b) = 6 f(c) = 8 f(d) = 3 f(g) = 5 f(h) = 2 f(i) = 4 f(j) = 7.

Module #19: Graph Theory: part II Rosen 5 th ed., chs. 8-9.

Graphs What are Graphs? General meaning in everyday math: A plot or chart of numerical data using a coordinate system. Technical meaning in discrete.

September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.

Chapter 5 Graphs  the puzzle of the seven bridge in the Königsberg,  on the Pregel.

CS 103 Discrete Structures Lecture 20

Relation. Combining Relations Because relations from A to B are subsets of A x B, two relations from A to B can be combined in any way two sets can be.

Representing Relations Using Matrices A relation between finite sets can be represented using a zero-one matrix Suppose R is a relation from A = {a 1,

Graphs Basic properties.

1 1.6: Inverse functions. Find the inverse of the function and algebraically verify they are inverses.

Week 11 - Wednesday.  What did we talk about last time?  Graphs  Paths and circuits.

(CSC 102) Lecture 30 Discrete Structures. Graphs.

Chap 7 Graph Def 1: Simple graph G=(V,E) V : nonempty set of vertices E : set of unordered pairs of distinct elements of V called edges Def 2: Multigraph.

9.5 Euler and Hamilton graphs. 9.5: Euler and Hamilton paths Konigsberg problem.

1 Lecture 5 (part 2) Graphs II (a) Circuits; (b) Representation Reading: Epp Chp 11.2, 11.3

Relations and Functions Objective: To use tables and graphs to represent relations and functions.

Applied Discrete Mathematics Week 14: Trees

Chapter 9 (Part 2): Graphs

Special Graphs By: Sandeep Tuli Astt. Prof. CSE.

Graphs Hubert Chan (Chapter 9) [O1 Abstract Concepts]

Representing Graphs and

NP-Completeness (36.4-5) P: yes and no in pt NP: yes in pt NPH  NPC

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Graphs Slides are adopted from “Discrete.

Based on slides by Y. Peng University of Maryland

Connected Components Minimum Spanning Tree

Missing Views Sections and of Text.

Isomorphism in GRAPHS.

Relations and Digraphs

Walks, Paths, and Circuits

Discrete Mathematics Lecture 13_14: Graph Theory and Tree

Copyright © Cengage Learning. All rights reserved.

Euler and Hamilton Paths

Graphs G = (V, E) V are the vertices; E are the edges.

GRAPHS G=<V,E> Adjacent vertices Undirected graph

Chapter 5 Graphs the puzzle of the seven bridge in the Königsberg,

Name:___________________________ Date:______________

Simple Graphs: Connectedness, Trees

Bipartite graphs and Planar Graphs

12 Further mathematics Adjacency Matrices.

9.4 Connectivity.

Applied Discrete Mathematics Week 13: Graphs

Based on slides by Y. Peng University of Maryland

Agenda Review Lecture Content: Shortest Path Algorithm

Presentation transcript:

9.3: Representing Graphs and Graph Isomorphism

Graphs, Edge tables, and adjacency matrices a bababab cdcdcdc edge lists Vertex adjacency vertexinitial vertex terminal vertex adjacency matrices

1-1 correspondence Def: When 2 simple graphs G1=(V1,E1) and G2=(V2,E2), there is a one-to-one correspondence (one-to-one and onto) between vertices of the two graphs that preserves the adjacency relationship. (i.e.: a and b are adjacent in G1 iff f(a) and f(b) are adjacent in G2). Examples:

Examples (sketch03)

How can you tell if 2 graphs are isomorphic, or not? It can be hard to tell, and it is impractical to check all n! possible correspondences. Two graphs are not isomorphic if they do not share an invariant property Question: Name some properties that two isomorphic graphs should share. Examples:

More examples B A C AC E DED # vertices# edgesDegreesCorresponding vertices Corresponding subgroups

More examples # vertices# edgesDegreesCorresponding vertices Corresponding subgroups

Define a 1-1 correspondence between vertices Example