Discrete Math

The following topics on Discrete Math will be covered here.

Logic

1. Mathematical Logic
2. Tautology, Contradiction, and Contingency
3. Logical Equivalence
4. Conjunctive and Disjunctive Normal Form (PDNF & CDNF)
5. Determine whether the following argument is valid
6. Prove that a Distributive Lattice is Modular

Combinatorics

Pigeonhole Principle: Statement, Examples, Generalised Version

Graph Theory

1. Degree of a Vertex in Graph: Definition, Examples, Handshaking Theorem
2. Simple Graph has Two Vertices of Same Degree: proof
3. Prove that a tree with n vertices has (n-1) edges
4. A graph is a tree if and only if it is minimally connected – Proof
5. Simple Graph with n Vertices and k Components have at most (n-k)(n-k+1)/2 Edges
6. Chromatic number of a complete graph with n vertices is n
7. Chromatic number of a cycle with n vertices is 2 if n even and 3 if n odd
8. Kuratwoski’s First Graph and Second Graph

Discrete Math Practice Problems

Discrete Math Problems, Practice Final Exam