Course Aim: Introduce students to basic concepts of graph theory, graph properties and formulations of typical graph problems. This is also supplemented with some abstract-level algorithms for the presented problems and with some advanced graph theory topics.
Main Topics: The Basics and definitions of graph theory - graphs and their relatives - isomorphism and automorphism of graphs - degree sequences and edge counting - eulerian and hamiltonian walks/cycles -trees and networks - traveling salesman problem (TSP) - graph matchings- euler's formula - networks flows - graph colorings - combinatorial objects and techniques - sets and subsets- sequences - basic principles of counting- permutations and factorials - fibonacci numbers- catalan numbers – inclusion – exclusion - recursions - pigeonhole principle- estimations - algebraic combinatorics: binomial coefficients - pascal's triangle - geometric combinatorics.
Main Topics: The Basics and definitions of graph theory - graphs and their relatives - isomorphism and automorphism of graphs - degree sequences and edge counting - eulerian and hamiltonian walks/cycles -trees and networks - traveling salesman problem (TSP) - graph matchings- euler's formula - networks flows - graph colorings - combinatorial objects and techniques - sets and subsets- sequences - basic principles of counting- permutations and factorials - fibonacci numbers- catalan numbers – inclusion – exclusion - recursions - pigeonhole principle- estimations - algebraic combinatorics: binomial coefficients - pascal's triangle - geometric combinatorics.
- Teacher: khaled Walid Mohammed Tariq
- Teacher: nada Khalid Khalid Bilal