![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
||
![]() |
Fundamentals. Definition. Paths cycles and trees. Hamilton cycles and Euler circuits. Planer graphs. Flows, Connectivity and Matching Network flows. Connectivity and Menger’s theorem. External problems paths and Complete Subgraphs. Hamilton path and cycles. Colouring. Vertex colouring Edge colouring. Graph on surfaces. |
Credit hours/ Marks:- (3 credits) |
|