THEORETICAL AND ALGORITHMIC APPROACH TO GRAPH THEORY

Graph Theory is one of the interesting and important branches of Discrete Mathematics. Various problems in Graph theory have been evolved due to its applications in fields like computer science, medicine, circuit theory, coding theory, networking and several others. 

Graph theory models a large scale of problems by observing relationship between objects and classifies them as deterministic, NP and polynomial solvable problems.

 Apart from investigating solutions for those problems, there are trendy methods to prove the solution which can be categorized as theoretical and algorithmic approaches.  A theoretical approach is one in which abstract graph theoretic concepts are availed to facilitate the solution while algorithmic approach is one in which a step-by-step algorithm is used as a tool to solve problems. 

This is the major focus of this symposium. This symposium serves as a platform to present research papers on various graph theoretical problems.