Welcome to Department of Mathematics

Mail Us

Call Us

Graph Theory

Code: MA502 | L-T-P-C: 3-0-0-6

Isomorphism, incidence and adjacency matrices, Sperner lemma, Trees,Cayley formula, connector problem, connectivity, constructing reliable communication network, Euler tours, Hamilton cycle, Chinese postman and traveling salesman problems, matchings and coverings, perfect matchings, edge colouring, Vizing Theorem, time table problem, Independent sets, Ramsey theorem, Turan theorem, Schur theorem, vertex colouring, Brook theorem, Hajos conjecture, chromatic polynomials, storage problem, planarity, dual graphs, Euler formula, Kuratowski theorem, five colour theorem, history of four colour theorem, nonhamiltonian planar graphs, planarity algorithm, directed graphs, job sequencing, one way road system, ranking participants in tournaments.


  1. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.North-Holland, 1976.
  2. J. M. Aldous. Graphs and Applications. Springer, LPE, 2007