Karabakh University Courses
In this section
List of all courses
[RIM 452] Graph Theory
Instruction Language
Azerbaijani
Course Type
Elective - Block 5
Course Description
This course explores the mathematical study of networks composed of vertices (nodes) and edges (links). The curriculum focuses on fundamental concepts such as paths, cycles, connectivity, and graph isomorphisms. Students investigate classic problems and algorithms, including Eulerian and Hamiltonian paths, Prim’s and Kruskal’s algorithms for Minimum Spanning Trees, and Dijkstra’s algorithm for shortest paths. The course emphasizes graph coloring, planarity, and network flow optimization using the Max-Flow Min-Cut theorem. By the end of the semester, students will be capable of modeling complex systems such as social networks, transportation infrastructures, and circuit designs, providing essential analytical tools for computer science, operations research, and data structural analysis.
We use cookies in the delivery of our services. To learn about the cookies we use and information about your preferences and opt-out choices, please click here. By using our platform you agree to our use of cookies.
Decline
Accept
