06CS42 GRAPH THEORY AND COMBINATORIES syllabus for CS


Part A
Unit-1 Introduction to Graph Theory 7 hours

Introduction to Graph Theory: Definitions and Examples, Subgraphs, Complements, and Graph Isomorphism, Vertex Degree, Euler Trails and Circuits

Unit-2 Introduction to Graph Theory contd 6 hours

Introduction to Graph Theory contd.: Planar Graphs, Hamilton Paths and Cycles, Graph Colouring, and Chromatic Polynomials

Unit-3 Trees 6 hours

Trees: Definitions, Properties, and Examples, Routed Trees, Trees and Sorting, Weighted Trees and Prefix Codes

Unit-4 Optimization and Matching 7 hours

Optimization and Matching: Dijkstra’s Shortest Path Algorithm, Minimal Spanning Trees – The algorithms of Kruskal and Prim, Transport Networks – Max-flow, Min-cut Theorem, Matching Theory

Part B
Unit-5 Fundamental Principles of Counting 6 hours

Fundamental Principles of Counting: The Rules of Sum and Product, Permutations, Combinations – The Binomial Theorem, Combinations with Repetition, The Catalon Numbers

Unit-6 The Principle of Inclusion and Exclusion 6 hours

The Principle of Inclusion and Exclusion: The Principle of Inclusion and Exclusion, Generalizations of the Principle, Derangements – Nothing is in its Right Place, Rook Polynomials

Unit-7 Generating Functions 7 hours

Generating Functions: Introductory Examples, Definition and Examples – Calculational Techniques, Partitions of Integers, The Exponential Generating Function, The Summation Operator

Unit-8 Recurrence Relations 7 hours

Recurrence Relations: First Order Linear Recurrence Relation, The Second Order Linear Homogeneous Recurrence Relation with Constant Coefficients, The Non-homogeneous Recurrence Relation, The Method of Generating Functions

Last Updated: Tuesday, January 24, 2023