Course

M208 - Graph Theory

Course No: 
M208
Credit: 
4
Prerequisites: 
M101
Approval: 
2014
UG-Core
Syllabus: 
Graphs, subgraphs, graph isomorphisms, degree sequence, paths, cycles, trees, bipartite graphs, Hamilton cycles, Euler tours, directed graphs, matching, Tutte’s theorem, connectivity, Menger’s theorem, planar graphs, Kuratowski’s theorem, vertex and edge colouring of graphs, network flows, maxflow min-cut theorem, Ramsey theory for graphs, matrices associated with graphs.
Text Books: 
  1. R. Diestel, “Graph Theory”, Graduate Texts in Mathematics, 173. Springer, 2010.
Reference Books: 
  1. B. Bollob ́as, “Modern Graph Theory”, Graduate Texts in Mathematics, 184. Springer- Verlag, 1998.
  2. F. Harary, “Graph Theory”, Addison-Wesley Publishing Co., 1969.
  3. J. A. Bondy, U. S. R. Murty, “Graph Theory”, Graduate Texts in Mathematics, 244. Springer, 2008.

Contact us

School of Mathematical Sciences

NISERPO- Bhimpur-PadanpurVia- Jatni, District- Khurda, Odisha, India, PIN- 752050

Tel: +91-674-249-4081

Corporate Site - This is a contributing Drupal Theme
Design by WeebPal.