discrete mathematics structure

Identity Functions The function f is called the identity function if each element of set A has an image on itself i.e.…

Partial Order Relations A relation R on a set A is called a partial order relation if it satisfies the following three…

Inclusion-Exclusion Principle Let A, B be any two finite sets. Then n (A ∪ B) = n (A) + n (B) –…

Particular Solution (a) Homogeneous Linear Difference Equations and Particular Solution: We can find the particular solution of the difference equation when the…

Graph: Graph G consists of two things: 1. A set V=V(G) whose elements are called vertices, points or nodes of G. 2.…

Permutation and Combinations: Permutation: Any arrangement of a set of n objects in a given order is called Permutation of Object. Any…

Isomorphic Graphs Consider a graph G(V, E) and G* (V*,E*) are said to be isomorphic if there exists one to one correspondence…

Recurrence Relations A recurrence relation is a functional relation between the independent variable x, dependent variable f(x) and the differences of various…

Mathematical Functions The following are the functions which are widely used in computer science. 1. Floor Functions: The floor function for any…

Complete Graph A graph G is said to be complete if every vertex in G is connected to every other vertex in…