INDIAN INSTITUTE OF TECHNOLOGY ROORKEE NAME OF DEPTT./CENTRE: Mathematics I. Subject Code: IMA -08 Course Title:Graph Theory 2. Contact Hours: L: 3 T: 0 P20 3 Practical { 0 3, Examination Duration (Hrs): Theory 4. Relative Weightage: ows [ 15 | Prs| 0 |wre 35 |eTE| 50 Pre| 6. Semester: Both 7. Subject Area: BGSEC 8. Pre-requisite: Nil 9. Objective: To acquaint the students with the basic concepts of graph theory. 10, Details of Course: 5. Credits: Particulars Contact | | incidence and types of vertices, sub graphs, ‘somorphism between two | graphs, connectivity, traversability, Eulerian and Hamiltonian graphs, traveling salesman problem ee . | Trees and Fundamental Ci Definition and properties of trees, rooted 8 and binary trees, counting trees, spanning trees in a graph, fundamental | circuits, cut sets, separability, network flows, ee | a) 3. | Vector Spaces Associated with Graphs: Galois fields, vector spaces | + associated with graphs, orthogonal vectors and spaces. |" 4 | Matrix Representation of Graphs: Different types of matrices corresponding to a graph, incidence, circuits, cut-set, path and adjacency |__| matrices ofagraph, Planar and Colorings: Planar graphs, Kuratowski's graphs, detections of 5 | planarity, chromatic number, chromatic polynomial, chromatic partitioning, | | covering and four color problem, geometric dual, combinatorial dual Directed Graphs: Types of digraphs, digraphs ¢ and binary relations, directed | | paths and connectedness, Euler digraphs, adjacency graphs, pair comparison | { {_ and tournaments. aon | 7, | Enumeration & Polyas’s Enumeration Theory: Types of enumerations, | 6 | Polya’s counting theorem and its applications. —_ |11. Suggested Books: 7 Authors [Deo Narsingh; Graph Theory with Applications to Engineering and| 2004 Computer Science, Prentice Hall of India. Yearof Publication 2 Clark John and Holton D.A., A First Look At Graph Theory, Allied 1995, Publishers Ltd. : 3.__| West Denglas B., Introduction to Graph Theory, Pearson Education. 2002 4. /Moit JL., Kandel A, and Baker T.P., Discrete Mathematics for| 2001 aly Computer Scientists and Mathematicians, Prentice Hall of India. | Reinhard ,Diestel, Graph Theory, 5} Inte nal Ed _ 2004 \Aldous J.M , Wilson R..,Graphs and Applications: An Introductory | 2007 | Approach ,Springer-Verla; l