Multiplication Theorem Theorem: If A and B are two independent events, then the probability that both will occur is equal to the…
Tag:
graphs
-
-
Operations on Sets The basic set operations are: 1. Union of Sets: Union of Sets A and B is defined to be…
-
Recursive functions in discrete mathematics A recursive function is a function that its value at any point can be calculated from the…
-
Identity Functions The function f is called the identity function if each element of set A has an image on itself i.e.…
-
Multisets A multiset is an unordered collection of elements, in which the multiplicity of an element may be one or more than…
-
Surjective Function in Discrete Mathematics The surjective function is also known as onto function. With the help of surjective function, we show…
-
Complete Graph A graph G is said to be complete if every vertex in G is connected to every other vertex in…
-
Types of Functions 1. Injective (One-to-One) Functions: A function in which one element of Domain Set is connected to one element of…
-
The Pigeonhole Principle If n pigeonholes are occupied by n+1 or more pigeons, then at least one pigeonhole is occupied by greater…
-
Regular Grammar in Discrete Mathematics The regular languages can be generated by regular grammar. In regular grammar, the left-hand side always consists…