techniques of counting

Principal Ideal Domain in Discrete mathematics The PID can be described as an integral domain in which a single element is used…

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…

Types of Sets Sets can be classified into many categories. Some of which are finite, infinite, subset, universal, proper, power, singleton set,…

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

Probability The word ‘Probability’ means the chance of occurring of a particular event. It is generally possible to predict the future of…

Relationship between number of nodes and height of binary tree In this section, we are going to learn a lot of cases…