Discrete Mathematics Tutorial

Sampling and Inference A sample is defined as a method of selecting a small section from a population or large data. The…

Probable error formula for discrete mathematics Probable Error The probable error can be described as a correlation coefficient. The value of the…

Rolle’s Mean Value Theorem Roll’s theorem is a special case of the mean value theorem. Rolle’s theorem states that if a f…

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

Graph isomorphism in Discrete Mathematics The isomorphism graph can be described as a graph in which a single graph can have more…

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

Types of Relations 1. Reflexive Relation: A relation R on set A is said to be a reflexive if (a, a) ∈…

Injective Function in Discrete mathematics The injective function is also known as the one-to-one function. With the help of injective function, we…

Principle of Duality in Discrete Mathematics The principle of duality is a type of pervasive property of algebraic structure in which two…

Regular Grammar in Discrete Mathematics The regular languages can be generated by regular grammar. In regular grammar, the left-hand side always consists…