Graphs: Connectivity, Matching, Colouring (GATE CS) — GATE Computer S…
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity, matching, colouring. Combinatorics: counting, recurrence relations, generating functions.
- Exam: GATE Computer Science and Information Technology (CS)
- Section: Engineering Mathematics (13M)