Scribd
Upload
91 views

DMS - Mod-2 - L3 - Digraph Repre Relation

This document discusses representing relations using digraphs (directed graphs). It defines what a digraph is and how to construct one from a given relation. A relation R on a set A can be represented by a digraph where the vertices are the elements of A, and there is a directed edge from x to y if and only if the ordered pair (x,y) is in the relation R. The document gives an example of representing the less than relation on integers {1,2,3,4} as a digraph. It also discusses how to identify if a relation is reflexive, symmetric, or transitive based on the structure of its digraph representation.

Uploaded by

Kush
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
91 views

DMS - Mod-2 - L3 - Digraph Repre Relation

This document discusses representing relations using digraphs (directed graphs). It defines what a digraph is and how to construct one from a given relation. A relation R on a set A can be represented by a digraph where the vertices are the elements of A, and there is a directed edge from x to y if and only if the ordered pair (x,y) is in the relation R. The document gives an example of representing the less than relation on integers {1,2,3,4} as a digraph. It also discusses how to identify if a relation is reflexive, symmetric, or transitive based on the structure of its digraph representation.

Uploaded by

Kush
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/ 10

Amity School of Engineering & Technology (CSE)

Discrete Mathematics

Module II
Digraph Representation
of Relation

1
Amity School of Engineering & Technology (CSE)

Module II:
 Digraph Representation of
Relation

2
Amity School of Engineering & Technology (CSE)

OBJECTIVES
After completing this section, you will be able to

 Explain Digraph (directed graph)

 Understand how to make a digraph of a given relation

3
Amity School of Engineering & Technology (CSE)

Representing Relation using Digraph


Pictorial representation is an another way of
representing a relation (also known as Directed
graph or simply Digraph).

Digraph representation of binary relations:

A binary relation on a set can be represented by a digraph.


Let R be a binary relation on a set A, that is R is a subset of .
Then the digraph, call it G, representing R can be constructed as follows:
    1. The vertices of the digraph G are the elements of A, and
    2. <x, y> is an arc of G from vertex x to vertex y if and only if <x, y> is
in R.

4
Amity School of Engineering & Technology (CSE)

Example
The less than relation R on the set of integers A ={1,2,3,4} is
the set {(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)}
and it can be represented by the following digraph:

5
Amity School of Engineering & Technology (CSE)

Digraph representation: Reflexive, Symmetric & Transitive


Relation:

6
Amity School of Engineering & Technology (CSE)

Example

7
Amity School of Engineering & Technology (CSE)

Check your progress1

8
Amity School of Engineering & Technology (CSE)

Summary
 A relation R on a set A is called reflexive if there is a self loop
at each node in directed graph of a relation.

 A relation R on a set A is called symmetric if there is an arrow


from then there is a return arrow from .

 A relation R on a set A is said to be transitive if there is an


arrow from then there is an arrow from .

9
Amity School of Engineering & Technology (CSE)

10

You might also like