subject

NPTEL: Advanced Graph Theory

Advanced Graph Theory focuses on problem solving using the most important notions of graph theory with an in-depth study of concepts on the applications in the field of computer science. This course provides an in-depth understanding of Graphs and fundamental principles and models underlying the theory, algorithms, and proof techniques in the field of Graph Theory. Emerging applications of Graph Theory in Computer Science domain will be covered for significant impact. Upon completing this course, students will have intimate knowledge about how the graph theory play an important role to solve the technology driven and research oriented problems.

Syllabus

Week 1 : Basic Concepts: Graphs and digraphs, Incidence and adjacency matrices, isomorphism, the automorphism group.
Week 2 : Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger s theorem; Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy and Chvatal, girth, circumference, the Chinese Postman Problem, The Travelling Salesman problem, diameter and maximum degree, shortest paths.
Week 3 : Trees: Equivalent definitions of trees and forests, Cayleys formula, the Matrix-Tree theorem, minimum spanning trees;
Week 4 : Matchings: Berges Theorem, perfect matchings, Halls theorem, Tuttes theorem, Konigs theorem, Petersens theorem, Algorithms for matching and weighted matching (in both bipartitie and general graphs), factors of graphs (decompositions of the complete graph), Tuttes f-factor theorem;
Week 5 : Extremal problems: Independent sets and covering numbers, Turans theorem, Ramsey theorems;
Colorings: Brooks theorem, the greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic polynomials, girth and chromatic number
Week 6 : Vizings theorem; Graphs on surfaces: Planar graphs, duality, Eulers formula, Kuratowskis theorem, toroidal graphs, 2-cell embeddings, graph on other surfaces;
Week 7 : Directed graphs: Tournaments, directed paths and cycles, Connectivity and strongly connected digraphs, branchings;
Networks and flows: Flow cuts, Max flow min cut theorems, perfect square;
Week 8 : Selected topics: Dominating sets, The reconstruction problem, Intersection graphs, Perfect graphs, Random graphs.

0 Student
reviews
Cost Free Online Course
Pace Upcoming
Provider NPTEL
Language English
Calendar 8 weeks long

Disclosure: To support our site, Class Central may be compensated by some course providers.

+ Add to My Courses
FAQ View All
What are MOOCs?
MOOCs stand for Massive Open Online Courses. These are free online courses from universities around the world (eg. Stanford Harvard MIT) offered to anyone with an internet connection.
How do I register?
To register for a course, click on "Go to Class" button on the course page. This will take you to the providers website where you can register for the course.
How do these MOOCs or free online courses work?
MOOCs are designed for an online audience, teaching primarily through short (5-20 min.) pre recorded video lectures, that you watch on weekly schedule when convenient for you.  They also have student discussion forums, homework/assignments, and online quizzes or exams.

0 reviews for NPTEL's Advanced Graph Theory

Write a review

Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free