Previously, we have already discussed Relations and their basic types.

**Combining Relation:**

Suppose R is a relation from set A to B and S is a relation from set B to C, the combination of both the relations is the relation which consists of ordered pairs (a,c) where a Є A and c Є C and there exist an element b Є B for which (a,b) Є R and (b,c) Є S. This is represented as RoS.

**Inverse Relation:**

A relation R is defined as (a,b) Є R from set A to set B, then the inverse relation is defined as (b,a) Є R from set B to set A. Inverse Relation is represented as R^{-1}

R^{-1} = {(b,a) | (a,b) Є R}.

**Complementary Relation:**

Let R be a relation from set A to B, then the complementary Relation is defined as- {(a,b) } where (a,b) is not Є R.

**Represenation of Relations:**

Relations can be represented as- Matrices and Directed graphs.

**Relation as Matrices:**

A relation R is defined as from set A to set B,then the matrix representation of relation is M_{R}= [m_{ij}] where

m_{ij} = { 1, if (a,b) Є R

0, if (a,b) Є R }

**Properties:**

- A relation R is reflexive if the matrix diagonal elements are 1.

- A relation R is irreflexive if the matrix diagonal elements are 0.
- A relation R is symmetric if the transpose of relation matrix is equal to its original relation matrix. i.e. M
_{R}= (M_{R})^{T}.

- A relation R is antisymmetric if either m
_{ij}= 0 or m_{ji}=0 when i≠j. - A relation follows join property i.e. the join of matrix M1 and M2 is M1 V M2 which is represented as R1 U R2 in terms of relation.
- A relation follows meet property i.r. the meet of matrix M1 and M2 is M1 ^ M2 which is represented as R1 Λ R2 in terms of relation.

**Relations as Directed graphs:**

A directed graph consists of nodes or vertices connected by directed edges or arcs. Let R is relation from set A to set B defined as (a,b) Є R, then in directed graph-it is represented as edge(an arrow from a to b) between (a,b).

**Properties:**

- A relation R is reflexive if there is loop at every node of directed graph.
- A relation R is irreflexive if there is no loop at any node of directed graphs.
- A relation R is symmetric if for every edge between distinct nodes, an edge is always present in opposite direction.
- A relation R is asymmetric if there are never two edges in opposite direction between distinct nodes.
- A relation R is transitive if there is an edge from a to b and b to c, then there is always an edge from a to c.

**Example:**

The directed graph of relation R = {(a,a),(a,b),(b,b),(b,c),(c,c),(c,b),(c,a)} is represented as :

Since, there is loop at every node,it is reflexive but it is neither symmetric nor antisymmetric as there is an edge from a to b but no opposite edge from b to a and also directed edge from b to c in both directions. R is not transitive as there is an edge from a to b and b to c but no edge from a to c.

This article is contributed by **Nitika Bansal**.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above

**Related Articles:**

Relations and their types

## Recommended Posts:

- Mathematics | Closure of Relations and Equivalence Relations
- Mathematics | Introduction and types of Relations
- Discrete Mathematics | Representing Relations
- Mathematics | Planar Graphs and Graph Coloring
- Discrete Mathematics | Types of Recurrence Relations - Set 2
- Practice Set for Recurrence Relations
- Digital Logic | Binary representations
- Different types of recurrence relations and their solutions
- Number of possible Equivalence Relations on a finite set
- DBMS | Minimum relations satisfying 1NF
- Different Operations on Matrices
- Mathematics | Generalized PnC Set 2
- Mathematics | Probability
- Mathematics | Generalized PnC Set 1
- Mathematics | Rules of Inference