discrete mathematics structure

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…

Mathematical Induction The process to establish the validity of an ordinary result involving natural numbers is the principle of mathematical induction. Working…

Representation of Graphs There are two principal ways to represent a graph G with the matrix, i.e., adjacency matrix and incidence matrix…

Multiplication Theorem Theorem: If A and B are two independent events, then the probability that both will occur is equal to the…

Representation of Relations Relations can be represented in many ways. Some of which are as follows: 1. Relation as a Matrix: Let…

Multisets A multiset is an unordered collection of elements, in which the multiplicity of an element may be one or more than…

Tautologies and Contradiction Tautologies A proposition P is a tautology if it is true under all circumstances. It means it contains the…