Inclusion-Exclusion Principle Let A, B be any two finite sets. Then n (A ∪ B) = n (A) + n (B) –…
discrete mathematics structure
-
-
Basic Counting Principles Sum Rule Principle: Assume some event E can occur in m ways and a second event F can occur…
-
Lattices: Let L be a non-empty set closed under two binary operations called meet and join, denoted by ∧ and ∨. Then…
-
Basic Logical Operations 1. Negation: It means the opposite of the original statement. If p is a statement, then the negation of…
-
Logic Gates and Circuits: Schematic or Graphical Representation of Boolean Expressions: The Boolean expressions can be graphically represented by using logic circuits.…
-
Binary Relation Let P and Q be two non- empty sets. A binary relation R is defined to be a subset of…
-
Spanning Tree A subgraph T of a connected graph G is called spanning tree of G if T is a tree and…
-
Closure Properties of Relations Consider a given set A, and the collection of all relations on A. Let P be a property…
-
Normal SubGroup: Let G be a group. A subgroup H of G is said to be a normal subgroup of G if…
-
Composition of Relations Let A, B, and C be sets, and let R be a relation from A to B and let…