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
INDUSTRY SUPPORT
It will be recognized by several industries & academic institutes
ABOUT THE INSTRUCTOR
Prof.Soumen Maity is an Associate Professor of Mathematics at Indian Institute of ScienceEducation and Research (IISER) Pune. He received a PhD from the Theoretical Statistics & Mathematics Unit at Indian Statistical Institute (ISI) Kolkata, India in 2002. He has postdoctoral experience from Lund University, Sweden; Indian Institute of Management (IIM) Kolkata, India; and University of Ottawa,Canada. Prior to joining IISER Pune in 2009, he worked as Assistant Professor at IIT Guwahati and IITKharagpur.
Additional information
Institute
IISER Pune
Total hours
20
Certification Process
1. Join the course
Learners may pay the applicable fees and enrol to a course on offer in the portal and get access to all of its contents including assignments. Validity of enrolment, which includes access to the videos and other learning material and attempting the assignments, will be mentioned on the course. Learner has to complete the assignments and get the minimum required marks to be eligible for the certification exam within this period.
COURSE ENROLMENT FEE: The Fee for Enrolment is Rs. 2000 + GST
2. Watch Videos+Submit Assignments
After enrolling, learners can watch lectures and learn and follow it up with attempting/answering the assignments given.
3. Get qualified to register for exams
A learner can earn a certificate in the self paced course only by appearing for the online remote proctored exam and to register for this, the learner should get minimum required marks in the assignments as given below:
CRITERIA TO GET A CERTIFICATE
Assignment score = Score more than 50% in at least 6/8 assignments.
Exam score = 50% of the proctored certification exam score out of 100
Only the e-certificate will be made available. Hard copies will not be dispatched.”
4. Register for exams
The certification exam is conducted online with remote proctoring. Once a learner has become eligible to register for the certification exam, they can choose a slot convenient to them from what is available and pay the exam fee. Schedule of available slot dates/timings for these remote-proctored online examinations will be published and made available to the learners.
EXAM FEE: The remote proctoring exam is optional for a fee of Rs.1500 + GST. An additional fee of Rs.1500 will apply for a non-standard time slot.
5. Results and Certification
After the exam, based on the certification criteria of the course, results will be declared and learners will be notified of the same. A link to download the e-certificate will be shared with learners who pass the certification exam.
CERTIFICATE TEMPLATE
Course Details
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
Books and References:
Introduction to Graph Theory: D.B. West (2001) Prentice Hall.
Graph Theory: F.Harary (1969) Addison-Wesley.
Graph Theory: R. Diestel (2006) Springer .and network information science. This course introduces in an elementary way some basic knowledge and the primary methods in Graph Theory
P.Keerthana –
Nice