Embedded Files
Class overview
This course introduces fundamental concepts in Graph Theory, including properties and characterisation of graph/trees and graph theoretic algorithms, which are widely used in Mathematical modelling and has got applications across Computer Science and other branches in Engineering..
Course Outcomes
Explain vertices and their properties, types of paths, classification of graphs and trees & their properties. (Cognitive Knowledge Level: Understand)
Demonstrate the fundamental theorems on Eulerian and Hamiltonian graphs.(Cognitive Knowledge Level: Understand)
Illustrate the working of Prim’s and Kruskal’s algorithms for finding minimum cost spanning tree and Dijkstra’s and Floyd-Warshall algorithms for finding shortest paths. (Cognitive Knowledge Level: Apply)
Explain planar graphs, their properties and an application for planar graphs.(Cognitive Knowledge Level: Apply)
Illustrate how one can represent a graph in a computer. (Cognitive Knowledge Level: Apply)
Illustrate an application for Partially Ordered Sets and Complete Lattices, in Computer Science (Cognitive Knowledge Level: Apply)
Explain the Vertex Color problem in graphs and illustrate an example application for vertex coloring. (Cognitive Knowledge Level: Apply)
Contact Me
Varun Soman
Assistant Professor
Department of Mathematics
College of Engineering Trivandrum
Thiruvananthapuram 695016
Mobile:- 9744562644
Page updated
Report abuse