Get started with custom lists to organize and share courses.

Sign up

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Taken this course? Share your experience with other students. Write review

Overview

Graph theory began in 1736 when the Swiss mathematician Euler solved Konigsberg seven-bridge problem. It has been two hundred and eighty years till now. Graph theory is the core content of Discrete Mathematics, and Discrete Mathematics is the theoretical basis of computer science and network information science. This course introduces in an elementary way some basic knowledge and the primary methods in Graph Theory.

Syllabus

Week 1: Paths, Cycles, Trails, Eulerian Graphs, Hamiltonian Graphs
 Week 2: Bipartite graphs, Trees, Minimum Spanning Tree Algorithms
 Week 3: Matching and covers
 Week 4: Maximum matching in Bipartite Graphs
 Week 5: Cuts and Connectivity
 Week 6: 2-connected graphs
 Week 7: Network flow problems, Ford-Fulkerson algorithm
 Week 8
: Planar graphs; Coloring of graphs

Taught by

Prof. Soumen Maity

Reviews for NPTEL's Graph Theory
Based on 0 reviews

  • 5 star 0%
  • 4 star 0%
  • 3 star 0%
  • 2 star 0%
  • 1 star 0%

Did you take this course? Share your experience with other students.

Write a review

Class Central

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

Sign up for free

Never stop learning Never Stop Learning!

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