MTL768: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) Creating course page via bot |
Bot: wrap bare course codes in wikilinks |
||
| Line 5: | Line 5: | ||
| credit_structure = 3-0-0 | | credit_structure = 3-0-0 | ||
| pre_requisites = | | pre_requisites = | ||
| overlaps = MTL776 | | overlaps = [[MTL776]] | ||
}} | }} | ||
== MTL768 : Graph Theory == | == MTL768 : Graph Theory == | ||
Introduction to Graphs: Definition and basic concepts; Trees: characterizations, counting of minimum spanning tree; Paths and Distance in Graphs: Basic Definitions, center and median of a graph, activity digraph and critical path; Eulerian Graphs: Definition and Characterization; Hamiltonian Graphs: Necessary and sufficient conditions, Planar Graphs: properties, dual, genus of a graph; Graph Coloring: vertex coloring, chromatic polynomials, edge coloring, planar graph coloring; Matching and Factorizations: maximum matching in bipartite graphs, maximum matching in general graphs, Hall's marriage theorem, factorization; Networks: The Max-flow min-cut theorem, connectivity and edge connectivity, Menger's theorem; Graph and Matrices. | Introduction to Graphs: Definition and basic concepts; Trees: characterizations, counting of minimum spanning tree; Paths and Distance in Graphs: Basic Definitions, center and median of a graph, activity digraph and critical path; Eulerian Graphs: Definition and Characterization; Hamiltonian Graphs: Necessary and sufficient conditions, Planar Graphs: properties, dual, genus of a graph; Graph Coloring: vertex coloring, chromatic polynomials, edge coloring, planar graph coloring; Matching and Factorizations: maximum matching in bipartite graphs, maximum matching in general graphs, Hall's marriage theorem, factorization; Networks: The Max-flow min-cut theorem, connectivity and edge connectivity, Menger's theorem; Graph and Matrices. | ||
Latest revision as of 16:43, 14 April 2026
| MTL768 | |
|---|---|
| Graph Theory | |
| Credits | 3 |
| Structure | 3-0-0 |
| Pre-requisites | |
| Overlaps | MTL776 |
MTL768 : Graph Theory
Introduction to Graphs: Definition and basic concepts; Trees: characterizations, counting of minimum spanning tree; Paths and Distance in Graphs: Basic Definitions, center and median of a graph, activity digraph and critical path; Eulerian Graphs: Definition and Characterization; Hamiltonian Graphs: Necessary and sufficient conditions, Planar Graphs: properties, dual, genus of a graph; Graph Coloring: vertex coloring, chromatic polynomials, edge coloring, planar graph coloring; Matching and Factorizations: maximum matching in bipartite graphs, maximum matching in general graphs, Hall's marriage theorem, factorization; Networks: The Max-flow min-cut theorem, connectivity and edge connectivity, Menger's theorem; Graph and Matrices.