Representation of Relation in Graphs and Matrices

Discrete Mathematics | Representing Relations

Last Updated : 29 Jul, 2024

Prerequisite -

Introduction and types of Relations

Relations are represented using ordered pairs, matrix and digraphs:

Ordered Pairs - In this set of ordered pairs of x and y are used to represent relation. In this corresponding values of x and y are represented using parenthesis.
```
Example: {(1, 1), (2, 4), (3, 9), (4, 16), (5, 25)}
This represent square of a number which means if x=1 then y = x*x = 1 and so on.
```
Representing using Matrix - In this zero-one is used to represent the relationship that exists between two sets. In this if a element is present then it is represented by 1 else it is represented by 0. In this method it is easy to judge if a relation is reflexive, symmetric or transitive just by looking at the matrix.
```
Suppose R is a relation from X={x1, x2, .....xn} to Y={y1, y2....yn}
It is represented by :-
M[i, j]={1, if (Xi, Yj) belongs to R
        0, if (Xi, Yj) does not belong to R}
```
If A={1, 2, 3} and B={1, 2} and Relation R is R = {(2, 1), (3, 1), (3, 2)} then all corresponding value of Relation will be represented by "1" else "0". It is represented as: It's corresponding possible relations are:
Digraph - A digraph is known was directed graph. It consists of set 'V' of vertices and with the edges 'E'. Here E is represented by ordered pair of Vertices. In the edge (a, b), a is the initial vertex and b is the final vertex. If edge is (a, a) then this is regarded as loop. Example: Suppose we have relation forming
```
R = {(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)} 
```
This relation is represented using digraph as:

Representation of Relation in Graphs and Matrices

V

vaishali bhatia

Improve

Article Tags :

Similar Reads

Propositional Equivalences

Propositional equivalences are fundamental concepts in logic that allow us to simplify and manipulate logical statements. Understanding these equivalences is crucial in computer science, engineering, and mathematics, as they are used to design circuits, optimize algorithms, and prove theorems. This

Predicates and Quantifiers

Predicates and Quantifiers are fundamental concepts in mathematical logic, essential for expressing statements and reasoning about the properties of objects within a domain. These concepts are widely used in computer science, engineering, and mathematics to formulate precise and logical statements.

Predicates and Quantifiers - Set 2

Before diving into the article, you need to know about predicates, quantifiers, and propositional logic rules.Logical Equivalences involving QuantifiersTwo logical statements involving predicates and quantifiers are considered equivalent if and only if they have the same truth value no matter which

Mathematics | Some Theorems on Nested Quantifiers

Quantifiers are expressions that indicate the scope of the term to which they are attached, they are predicates. A predicate is a property the subject of the statement can have. For example, in the statement "the sum of x and y is greater than 5", the predicate 'Q' is- sum is greater than 5, and the

Rules of Inference

Rules of Inference: Rules of inference are logical tools used to derive conclusions from premises. They form the foundation of logical reasoning, allowing us to build arguments, prove theorems, and solve problems in mathematics, computer science, and philosophy. Understanding these rules is crucial

PDNF and PCNF in Discrete Mathematics

PDNF (Principal Disjunctive Normal Form)It stands for Principal Disjunctive Normal Form. It refers to the Sum of Products, i.e., SOP. For eg. : If P, Q, and R are the variables then (P. Q'. R) + (P' . Q . R) + (P . Q . R') is an example of an expression in PDNF. Here '+' i.e. sum is the main operato

Set theory is a branch of mathematics that deals with collections of objects. These collections are called sets. A set is simply a group of distinct things, like numbers, letters, or even everyday objects, that are grouped based on some common property.A set is a well-defined collection of distinct

A set is simply a collection of distinct objects. These objects can be numbers, letters, or even peopleâ€”anything! We denote a set using curly brackets.For example: A = {1, 2, 3}Set Operations can be defined as the operations performed on two or more sets to obtain a single set containing a combinati

Inclusion-Exclusion and its various Applications

In the field of Combinatorics, it is a counting method used to compute the cardinality of the union set. According to basic Inclusion-Exclusion principle: For 2 finite sets A_1 and A_2 , which are subsets of Universal set, then (A_1-A_2), (A_2-A_1) and (A_1\bigcap A_2) are disjoint sets. Hence it ca

Properties of Power Set

The power set of a set A, denoted as P(A), is the collection of all subsets of A, including:The empty set {}All single-element subsets {a}All possible combinations of elements from A, up to the entire set A itself.For example, if A={1,2}, the power set P(A) is {{},{1},{2},{1,2}}.Properties of Power