CSC503-AGT-Home

AGT Syllabus

CSC503.pdf

Reference

AGT Book

Algorithmic Graph Theory.pdf

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 donthave
• agt 8.pdf done donthave
• agt 9.pdf
• agt 10.pdf done
• Chromatic_No_and_degree_relation.pdf
• clique.pdf done donthave
• Dominating_Sets.pdf
• graph_decomposition.pdf
• maxflow.pdf
• Prims_and_Kruskals.pdf done
• Vertex_Transitive.pdf

PYQ

AGT PYQ

Quiz

• AGTT_quiz 1.pdf
• AGT QUIZ 2.pdf
• AGT QUIZ 3.pdf

PYQ

• AGT MID 21-22.pdf
  • solution: AGT MID 21-22 solution
• AGT END 23.pdf
  • solution: AGT END 23 Solution
• AGT Mid 23.pdf
• AGT END 23-24.pdf

Assignment & Questions

• AGT Questions.pdf

Link to original

Tutorials

AGT Tutorials

Old Tutorial

• AGT tut 1.pdf
• AGT tut 2.pdf
• AGT tut 3.pdf
• AGT tut 4.pdf
• AGT tut 5.pdf

Tutorial 1

1. Prove that the sum of degrees of all vertices in a graph is twice the number of edges in the graph.
   1. AGT Tut 1.1 solution
2. Prove that in any graph, the number of vertices with odd degrees is always even. 2. AGT Tut 1.2 solution

Tutorial 2

1. 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.
   1. AGT Tut 2.1 solution
2. Write the merge sort algorithm and analyse its time complexity using recursive tree method. 2. AGT Tut 2.2 solution

Tutorial 3

• AGT Tutorial 3.pdf

Link to original

Notes

Unit1

• AGT_Intro1.pdf done
• AGT_Intro_2.pdf done
• AGT_Intro3.pdf done
• AGT_Complexity.pdf
• AGT_Time_complexity.pdf
• AGT_DFS_BFS.pdf done
• AGT_Prims_and_Kruskal_Algorithms.pdf done
• AGT_Diastras_warshal-floyd.pdf done
• AGT_Bridge-1-24.pdf done

Unit 1 Short Notes

• Eular, Hamilton Cycles; Planer Graph; Coloring

Flow

AGT Flow mid