Available courses

Graph Theory

ABOUT THE COURSE 
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.

INTENDED AUDIENCE

B.Sc, M.Sc, B.Tech, M.Tech

PRE-REQUISITES: 
None

CORE/ELECTIVE: 
Elective

UG/PG:
 Both

INDUSTRIES THAT WILL RECOGNIZE THIS COURSE
It will be recognized by several industries & academic institutes

 COURSE LAYOUT
 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