AGT Syllabus
Reference
AGT Book
Notes
- AGT Complete.pdf
- table content: AGT Complete Table
Old Notes
- agt.pdf done
- agt 1.pdf done
- agt 2.pdf done
- agt 3.pdf done
- agt 4.pdf done
- agt 5.pdf done
- agt 6.pdf done donthave
- agt 7.pdf done
- agt 8.pdf done
- agt 9.pdf done
- agt 10.pdf done
- Chromatic_No_and_degree_relation.pdf done donthave
- clique.pdf done donthave
- Dominating_Sets.pdf done donthave
- graph_decomposition.pdf
- maxflow.pdf
- Prims_and_Kruskals.pdf done
- Vertex_Transitive.pdf
PYQ
AGT PYQ
Quiz
PYQ
Link to originalAssignment & Questions
Tutorials
AGT Tutorials
Old Tutorial
Tutorial 1
- Prove that the sum of degrees of all vertices in a graph is twice the number of edges in the graph.
- Prove that in any graph, the number of vertices with odd degrees is always even. 2. AGT Tut 1.2 solution
Tutorial 2
- For a bipartite graph with partite sets X and Y. Prove that the sum of degrees of vertices in X equals the sum of degrees of vertices in Y.
- Write the merge sort algorithm and analyse its time complexity using recursive tree method. 2. AGT Tut 2.2 solution
Tutorial 3
Tutorial 4
Tutorial 5
Tutorial 6
Link to original
Notes
Before Midsem
- AGT_Intro1.pdf
- AGT_Intro_2.pdf
- AGT_Intro3.pdf
- AGT_Complexity.pdf
- AGT_Time_complexity.pdf
- AGT_DFS_BFS.pdf
- AGT_Prims_and_Kruskal_Algorithms.pdf
- AGT_Diastras_warshal-floyd.pdf
- AGT_Bridge-1-24.pdf
- AGT_wagner_kuratowski.pdf
- AGT_konic.pdf
AFter Mid
Unit 1 Short Notes