Second Semester 2019-2020
Second Semester 2019-2020
Second Semester 2019-2020
21-23 To appreciate the difference between Eulerian Graphs, Hamiltonian Graphs, Chapter
edge traversal & vertex traversal Hamiltonian walk and numbers 6.1-6.3
24-26 To determine the matching number, Matchings, Factorization Chapter
covering number. 8.1-8.2
27-30 How simple concept of planarity of a Planar Graphs, Euler identity, Detection Chapter
graph is relevant to several problems. of planarity, Embedded graphs on 9.1-9.4
surface. Graph Minors, Embedding
graphs in graphs.
31-34 How graph coloring problem is related The four color problem, vertex Chapter
to independent sets of graph, scheduling coloring, edge coloring, chromatic 10.1-10.3
problems. number, chromatic partitioning, 13.1
domination number.
35-36 How concept of isomorphism is Directed graph, Euler digraph, Chapter
different in digraphs ,Difference Isomorphism in digraph 7.1-7.2
between different type connected Strongly connected & weakly
digraphs & spanning tree & directed connected digraphs,
spanning tree
37- 41 Directed weighted network, relevance of Network flow, Max Flow- Min Cut Chapter
maximum flow theorem, Fulkerson Algorithm for 14.1,
Maximum flow, Shortest path problem 14.2,
& Dijkstara Algorithm. 10.4.1-
10.4.3
(R1)
Evaluation Scheme:
Evaluation Component Duration Weight Date & Time Nature of
age Component
2/3 1.30 -3.00 PM
Mid-semester 90 Minutes 30% Closed book
Quizes 10 mts 30% Closed book
during
Total : 5
regular class
Best 4 will be taken hours
02/05 FN 50%Closed Book
Comprehensive 3 Hours 40%
50%Open Book