Course Description
Directed and undirected graphs. Paths. Cycles. Trees. Eulerian cycles. Matching and covering. Connectivity. Menger’s theorem. Network flow. Coloring. Applications in different areas: computer, physics and sociology science.
Course Objectives & Outcomes
Objectives:
- Equip the student with fundamental definitions and concepts of graph theory.
- Develop skills in applying core theorems and algorithms.
- Enable the student to generate different examples.
- Develop proof techniques such as bijections, minimal counterexamples, and induction.
- Develop the major viewpoints and goals of graph theory: classification, optimization, algorithms, and duality.
- Enable the student to apply his knowledge of graph theory to various problems in other areas.
Outcomes: Upon successful completion of this course, the student will be able to:
- Mention the fundamental definitions,
- Discuss the essential concepts of graph theory,
- State the core theorems,
- Interpret algorithms of graph theory,
- Outline various examples in graph theory,
- Discuss proofs including those using basic graph theory proof techniques,
- Distinguish the major viewpoints and goals of graph theory: classification, optimization, algorithms, and duality,
- Solve various problems in different areas using graph theory.
References
1. West, D.B. (2001) INTRODUCTION TO GRAPH THEORY, 2nd edition, Prentice Hall, ISBN-13: 978-0130144003, ISBN-10: 0130144002.
2. Trudeau, R.J. (1993) INTRODUCTION TO GRAPH THEORY, Dover Publications, INC, ISBN-13: 080-0759678709, ISBN-10: 0486678709.
Course ID: MATH 550
| Credit hours | Theory | Practical | Laboratory | Lecture | Studio | Contact hours | Pre-requisite | 3 | 3 | 3 | MATH 405 |
|---|
