Karnaugh Maps: A Karnaugh map is a planar area subdivided into 2n equal cells each representing a point for functions of n…
discrete mathematics structure
-
-
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…
-
The Pigeonhole Principle If n pigeonholes are occupied by n+1 or more pigeons, then at least one pigeonhole is occupied by greater…
-
Total Solution The total solution or the general solution of a non-homogeneous linear difference equation with constant coefficients is the sum of…
-
Planar Graph: A graph is said to be planar if it can be drawn in a plane so that no edge cross.…
-
Types of Functions 1. Injective (One-to-One) Functions: A function in which one element of Domain Set is connected to one element of…