discrete mathematics structure

Karnaugh Maps: A Karnaugh map is a planar area subdivided into 2n equal cells each representing a point for functions of n…

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…

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…