MATH F213

RELATIONS AND
DIRECTED GRAPHS
BITS Pilani Michael Alphonse
Hyderabad Campus
The topic to be covered

1. Relations and Directed Graphs

2. Equivalence Relations
3. Ordering Relations

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
Example(is a parent of relation)

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
Examples of Invariants

1. Number of Vertices
2. Number of Edges
3. Degree Spectrum : Collection of pairs (i, j) where i is the
in-degree and j is the out-degree of the same vertex,
with one pair of each of the vertices.

BITS Pilani, Hyderabad Campus

Prove that the above two digraphs are isomorphic. Ans:
f(a) = b, f(b) = c, f(c) = a, f(d) = e, f(e) = d.

Prove that this graph is not isomorphic to any of

the above graphs.
Have you observed any significance of this
example ?

Hint: In the 3rd graph there is a cycle of length 2.

BITS Pilani, Hyderabad Campus
Problems

For both questions consider the complete digraph with n vertices.

Answer for 8: If the subgraph contains k vertices then it can have k 2 possible edges.
These k vertices can be chosen from the n vertices of G in C(n, k) ways.
Therefore the total number of subgraphs with k vertices = C(n, k)[C(k 2, 0) + C(k2, 1) +
…+C(k2, k2)] =

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
Equivalence Relations

A relation R defined on a set A is called equivalence relation

if it is reflexive , symmetric and transitive.
Examples :
= is equivalence relation on R. but >, < are not equivalent
relations.
Isomorphism is an equivalence relation on digraphs.
Let A be any set. Give an example of an equivalence
relation on the power set of A.

BITS Pilani, Hyderabad Campus

Prove that the equivalence class defined by an equivalence relation on a set A
forms a partition of A.

BITS Pilani, Hyderabad Campus

Partial Order and Examples

We use ≤ to denote a partial order since this notion is derived from the
usual ‘less than or equal to’ relation on real numbers.

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
BITS Pilani, Hyderabad Campus
Special Elements in Posets

BITS Pilani, Hyderabad Campus

Poset Diagrams

BITS Pilani, Hyderabad Campus

Examples of Poset diagrams

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
Well Ordered Sets

BITS Pilani, Hyderabad Campus

Think : Can the notion of strong mathematical induction be generalized for well ordered
sets?

BITS Pilani, Hyderabad Campus

Enumerations

Let A be a set. An enumeration on A is nothing but writing

the elements of A (if possible) in some order a1, a2, a3, ….
In short, we transfer the well-ordered property of N to the
set A.

Give an enumeration for the set of all rationales.

BITS Pilani, Hyderabad Campus

Countable and Uncountable
Sets
Any set that has an enumeration is said to be countable set.
Any set that does not have enumeration is said to be
uncountable set.

The set of all sequences whose elements are 0 and 1 is

uncountable.

The set of real numbers is a totally ordered set which is

uncountable.

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus
Examples of Lattices

BITS Pilani, Hyderabad Campus

Problems

For the following posets determine all maximal, minimal elements and
greatest and least elements if they exist.

BITS Pilani, Hyderabad Campus

BITS Pilani, Hyderabad Campus