| Module Name | Download |
|---|---|
| noc20_ma05_assigment_1 | noc20_ma05_assigment_1 |
| noc20_ma05_assigment_2 | noc20_ma05_assigment_2 |
| noc20_ma05_assigment_3 | noc20_ma05_assigment_3 |
| noc20_ma05_assigment_4 | noc20_ma05_assigment_4 |
| noc20_ma05_assigment_5 | noc20_ma05_assigment_5 |
| noc20_ma05_assigment_6 | noc20_ma05_assigment_6 |
| noc20_ma05_assigment_7 | noc20_ma05_assigment_7 |
| noc20_ma05_assigment_8 | noc20_ma05_assigment_8 |
| noc20_ma05_assigment_9 | noc20_ma05_assigment_9 |
| Sl.No | Chapter Name | MP4 Download |
|---|---|---|
| 1 | Basic Concepts | Download |
| 2 | Basic Concepts 1 | Download |
| 3 | Eulerian and Hamiltonian Graph | Download |
| 4 | Eulerian and Hamiltonian Graph 1 | Download |
| 5 | Bipartite Graph | Download |
| 6 | Bipartite Graph | Download |
| 7 | Diameter of a graph; Isomorphic graphs | Download |
| 8 | Diameter of a graph; Isomorphic graphs | Download |
| 9 | Minimum Spanning Tree | Download |
| 10 | Minimum Spanning Trees (Cont.) | Download |
| 11 | Minimum Spanning Trees (Cont..) | Download |
| 12 | Minimum Spanning Trees (Cont...) | Download |
| 13 | Maximum Matching in Bipartite Graph | Download |
| 14 | Maximum Matching in Bipartite Graph 1 | Download |
| 15 | Hall's Theorem and Konig's Theorem | Download |
| 16 | Hall's Theorem and Konig's Theorem 1 | Download |
| 17 | Independent Set and Edge Cover | Download |
| 18 | Independent Set and Edge Cover 1 | Download |
| 19 | Matching in General Graphs | Download |
| 20 | Proof of Halls Theorem | Download |
| 21 | Stable Matching | Download |
| 22 | Gale-Shapley Algorithm | Download |
| 23 | Graph Connectivity | Download |
| 24 | Graph Connectivity 1 | Download |
| 25 | 2-Connected Graphs | Download |
| 26 | 2-Connected Graphs 1 | Download |
| 27 | Subdivision of an edge; 2-edge-connected graphs | Download |
| 28 | Problems Related to Graphs Connectivity | Download |
| 29 | Flow Network | Download |
| 30 | Residual Network and Augmenting Path | Download |
| 31 | Augmenting Path Algorithm | Download |
| 32 | Max-Flow and Min-Cut | Download |
| 33 | Max-Flow and Min-Cut Theorem | Download |
| 34 | Vertex Colouring | Download |
| 35 | Chromatic Number and Max. Degree | Download |
| 36 | Edge Colouring | Download |
| 37 | Planar Graphs & Euler's Formula | Download |
| 38 | Characterization Of Planar Graphs | Download |
| 39 | Colouring of Planar Graphs | Download |
| Sl.No | Chapter Name | English |
|---|---|---|
| 1 | Basic Concepts | Download To be verified |
| 2 | Basic Concepts 1 | Download To be verified |
| 3 | Eulerian and Hamiltonian Graph | Download To be verified |
| 4 | Eulerian and Hamiltonian Graph 1 | Download To be verified |
| 5 | Bipartite Graph | Download To be verified |
| 6 | Bipartite Graph | Download To be verified |
| 7 | Diameter of a graph; Isomorphic graphs | Download To be verified |
| 8 | Diameter of a graph; Isomorphic graphs | Download To be verified |
| 9 | Minimum Spanning Tree | Download To be verified |
| 10 | Minimum Spanning Trees (Cont.) | Download To be verified |
| 11 | Minimum Spanning Trees (Cont..) | Download To be verified |
| 12 | Minimum Spanning Trees (Cont...) | Download To be verified |
| 13 | Maximum Matching in Bipartite Graph | Download To be verified |
| 14 | Maximum Matching in Bipartite Graph 1 | Download To be verified |
| 15 | Hall's Theorem and Konig's Theorem | Download To be verified |
| 16 | Hall's Theorem and Konig's Theorem 1 | Download To be verified |
| 17 | Independent Set and Edge Cover | Download To be verified |
| 18 | Independent Set and Edge Cover 1 | Download To be verified |
| 19 | Matching in General Graphs | Download To be verified |
| 20 | Proof of Halls Theorem | Download To be verified |
| 21 | Stable Matching | Download To be verified |
| 22 | Gale-Shapley Algorithm | Download To be verified |
| 23 | Graph Connectivity | Download To be verified |
| 24 | Graph Connectivity 1 | Download To be verified |
| 25 | 2-Connected Graphs | Download To be verified |
| 26 | 2-Connected Graphs 1 | Download To be verified |
| 27 | Subdivision of an edge; 2-edge-connected graphs | Download To be verified |
| 28 | Problems Related to Graphs Connectivity | Download To be verified |
| 29 | Flow Network | Download To be verified |
| 30 | Residual Network and Augmenting Path | Download To be verified |
| 31 | Augmenting Path Algorithm | Download To be verified |
| 32 | Max-Flow and Min-Cut | Download To be verified |
| 33 | Max-Flow and Min-Cut Theorem | Download To be verified |
| 34 | Vertex Colouring | Download To be verified |
| 35 | Chromatic Number and Max. Degree | Download To be verified |
| 36 | Edge Colouring | Download To be verified |
| 37 | Planar Graphs & Euler's Formula | Download To be verified |
| 38 | Characterization Of Planar Graphs | Download To be verified |
| 39 | Colouring of Planar Graphs | Download To be verified |
| Sl.No | Language | Book link |
|---|---|---|
| 1 | English | Not Available |
| 2 | Bengali | Not Available |
| 3 | Gujarati | Not Available |
| 4 | Hindi | Not Available |
| 5 | Kannada | Not Available |
| 6 | Malayalam | Not Available |
| 7 | Marathi | Not Available |
| 8 | Tamil | Not Available |
| 9 | Telugu | Not Available |