Overview
Here the online lecture videos are listed module wise and topic wise. These will be updated in due course. The recorded live sessions are also appended.
Module 1, Lecture 1:- In this Introductory lecture on Graph theory, we introduce the basic concepts and applications
Module 1, Lecture 2:- Here we discuss some simple results including handshaking theorem and problems.
Module 1, Lecture 3:- We further introduce more terminologies including Complete graphs, Bipartite Graphs etc.
Module 1, Lecture 4:- Graph Isomorphisms and related problems are discussed.
Module 1, Lecture 5:- Here concepts of Walks and Paths in a Graph are introduced
Module 1, Lecture 6 Part 1:- Connectedness in a Graph is introduced.
Module 1, Lecture 6 Part 2:- Further results on connectedness are discussed.
Module 2, Lecture 1:- Euler Graph and it's characterisation is discussed.
Module 2, Lecture 2:- Unicursal Graphs are introduced
Module 2, Lecture 3:- Operations on Graphs are discussed here.
Module 2, Lecture 4:- Hamiltonian Graphs are introduced
Module 2, Lecture 5:- Directed Graphs and associated terminology are introduced
Module 2, Lecture 6:- Directed Graphs and binary relations and also various terminologies related to connectedness are discussed
Module 2, Lecture 7:- Here we discuss the Fleury's algorithm for finding Euler Circuits (lines) and paths (Unicursal lines) in a graph
Module 3, Lecture 1:- Here we discuss Trees and some of their properties
Module 3, Lecture 2:- Further properties of trees are analysed
Module 3, Lecture 3:- The concept of distance in a tree is introduced
Module 3, Lecture 4:- Binary trees and some related properties are discussed
Module 3, Lecture 5:- Spanning trees are introduced
Module 3, Lecture 6:- Kruskal's Algortihm for minimal spanning tree is introduced
Module 3, Lecture 7:- Prim's Algortihm for minimal spanning tree is introduced
Module 3, Lecture 8:- Dijkstra's Algorithm for shortest path is discussed
Module 4, Lecture 1:- Cut Sets are introduced
Module 4, Lecture 2:- Edge and Vertex Connectivity are discussed.
Module 4, Lecture 3:-Fundamental cut sets and ring sum of cut sets discussed
Module 4, Lecture 4:-Fundamental cut sets and circuits are discussed
Module 4, Lecture 5:-Planar Graphs are introduced
Module 4, Lecture 3:-Dual of a Planar Graph Introduced
Module 5, Lecture 1:- Graph Coloring
Module 5, Lecture 2:- Chromatic Polynomial
Module 5, Lecture 3:- Matchings and Coverings
Module 5, Lecture 4:- Matrix Representation