Week 14: Connectivity, Eulerian and Hamiltonian paths
Page 678
Course Material
- Week 01: Introduction to product, inclusion-exclusion formulae.
- Week 02: Recurrence relations and their solutions.
- Week 03: Generating functions, Double counting, Applications
- Week 04: Pigeonhole principle, applications, Relations
- Week 05: Permutations and combinations.
- Week 06: Binary relations
- Week 07: n-ary Relations, Closures of relations
- Week 08: Composition of relations, inverse relation
- Week 09: Mid Term Examination
- Week 10: Graphs: Graph terminology
- Week 11: Representation of graphs
- Week 12: Graphs isomorphism
- Week 13: Algebraic methods: the incidence matrix
- Week 14: Connectivity, Eulerian and Hamiltonian paths
- Week 15: Shortest path problem
- Week 16: Trees and spanning trees
- Week 17: Complete graphs and bivalent graphs
- Week 18:Final Term Examination
- Chapters 18
- Department Mathematics
- Teacher
Dr. Ahmad Muhammad Mumtaz
.JPG)