Relations (sections 7.1 – 7.5)

Slides:



Advertisements
Similar presentations
Chapter 9 Graphs.
Advertisements

8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Graph-02.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
1 Section 8.2 Graph Terminology. 2 Terms related to undirected graphs Adjacent: 2 vertices u & v in an undirected graph G are adjacent (neighbors) in.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Applied Discrete Mathematics Week 12: Trees
Discrete Mathematics Lecture 9 Alexander Bukharovich New York University.
Let us switch to a new topic:
9.2 Graph Terminology and Special Types Graphs
GRAPH Learning Outcomes Students should be able to:
Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,
1 Graphs Chapters 9.1 and 9.2 University of Maryland Chapters 9.1 and 9.2 Based on slides by Y. Peng University of Maryland.
GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,
Chapter 4 Relations and Digraphs
Module #19: Graph Theory: part I Rosen 5 th ed., chs. 8-9 내년 3 월 ? 교환 학생 프로그램 영어 점수 미리미리 준비하세요.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Lecture 10: Graphs Graph Terminology Special Types of Graphs
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
9.2: Graph Terminology. Special Simple Graphs Complete GraphsK 1,… CyclesC 3,… WheelsW 3,… N-cubesQ 1,… Complete bipartiteK 2,2,…
Tree A connected graph that contains no simple circuits is called a tree. Because a tree cannot have a simple circuit, a tree cannot contain multiple.
1 CS104 : Discrete Structures Chapter V Graph Theory.
Based on slides by Y. Peng University of Maryland
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 Relations and Their Properties
Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.
1 Graphs Terminology By: Sandeep Tuli Astt. Prof. CSE.
Chapter 9: 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.
1 Lecture 5 (part 2) Graphs II (a) Circuits; (b) Representation Reading: Epp Chp 11.2, 11.3
Relations and Graphs Relations and Graphs Sanjay Jain, Lecturer, School of Computing.
رياضيات متقطعة لعلوم الحاسب MATH 226. Chapter 10.
1 Graphs Chapters 10.1 and 10.2 University of Maryland Chapters 10.1 and 10.2 Based on slides by Y. Peng University of Maryland.
Trees.
Applied Discrete Mathematics Week 14: Trees
Relations Chapter 9.
Chapter 9 (Part 2): Graphs
Matrix Representation of Graphs
Let us switch to a new topic:
Applied Discrete Mathematics Week 13: Graphs
Basic Concepts Graphs For more notes and topics visit:
Special Graphs By: Sandeep Tuli Astt. Prof. CSE.
Graphs Hubert Chan (Chapter 9) [O1 Abstract Concepts]
Chapters 8.1 and 8.2 Based on slides by Y. Peng University of Maryland
Representing Graphs and
Discrete Structures – CNS2300
Graphs Chapters 10.1 and 10.2 Based on slides by Y. Peng University of Maryland.
Graphs.
Based on slides by Y. Peng University of Maryland
Rosen 5th ed., chs. 8-9 ~44 slides (more later), ~3 lectures
Chapters 8.1 and 8.2 Based on slides by Y. Peng University of Maryland
Summary 3 Discrete Probability (sections )
Relations.
CS100: Discrete structures
G-v, or G-{v} When we remove a vertex v from a graph, we must remove all edges incident with the vertex v. When a edge is removed from a graph, without.
Connectivity Section 10.4.
Theorem 5.13: For vT‘, l’(v)= min{l(v), l(vk)+w(vk, v)}
Proof Techniques.
Graphs G = (V, E) V are the vertices; E are the edges.
Definition 8: Graphs that have a number assigned to each edge or each vertex are called weighted graphs weighted digraphs.
9.4 Connectivity.
Paths and Connectivity
Applied Discrete Mathematics Week 13: Graphs
Based on slides by Y. Peng University of Maryland
Exam 3 review Chapter 9- Graphs.
Presentation transcript:

Relations (sections 7.1 – 7.5) Summary 3 Relations (sections 7.1 – 7.5) Definitions. (Binary) relation R from A to B: R  AB: ordered pairs Relation R on A: R  AA n-ary relation R  A1A2…An Functions are special cases of relations. (What are the differences?) Properties of relations Reflexive/irreflexive Symmetric/asymmetric/antisymmetric Transitive Properties reflected in graph and matrix representations Combining relations: R1  R2, R1  R2, R1 – R2, SR.

Equivalence relations Definition: reflexive, symmetric and transitive. Equivalence class: [a]R For all b, if bRa, then b  [a]R aRb iff [a] = [b] iff [a]  [b]   not aRb iff [a]  [b] iff [a]  [b] =  Partition of a set: (i) Ai   for iI (ii) Ai  Aj = , if i  j (iii) iI Ai = S All equivalence classes of R on A partition A.

Representing relations: R from A to B Set of ordered pairs: {(a, b)| aRb for (a, b)  AB} 0 – 1 matrix mij = 1, if (ai, bj)R, and mij = 0, if (ai, bj)R. Directed graph: (V, E) V = A  B ( or V = A if R is on A) (a, b)  E iff (a, b) R Be able to convert between the three representations

Graphs (sections 8.1 – 8.4) Definitions. Simple, undirected and directed graphs. Degree (indegree, outdegree) of vertex Loop, isolated and pendant vertices Special graphs Complete, bipartite, and complete bipartite, n-cube Subgraph Adjacency For undirected graphs:vV deg(v) = 2|E| For directed graphs: vV deg-(v) = vV deg+(v) = |E|

Representing graphs Adjacency lists Adjacency matrix aij = 1 if {vi, vj} is an edge of G; and aij = 0 otherwise. Connectivity Path, path length, simple path, circuit A (undirected) graph is connected if there is a path between any pair of vertices Strongly and weakly connected directed graphs Connected components of a graph

Types of Questions Conceptual Problem solving Proofs Definitions of terms True/false Simple questions Problem solving Work with small concrete example problems Use your knowledge in a comprehensive way for problem-solving: set/subset/Cartesian product/relation/matrix/graph Proofs Simple theorems or propositions Possible proof methods Induction / Direct proof /Proof by contradiction