Anna University Regulation 2013 Computer Science and Engineering (CSE) CS6702 GTA Syllabus for all 5 units are provided below. Download link for CSE 7th SEM CS6702 Graph Theory & Applications Syllabus is listed down for students to make perfect utilization and score maximum marks with our study materials.

Anna University Regulation 2013 Computer Science and Engineering (CSE) 7th SEM CS6702 GTA – Graph Theory & Applications Syllabus
CS6702 GRAPH THEORY AND APPLICATIONS L T P C 3 0 0 3
OBJECTIVES:
The student should be made to: x Be familiar with the most fundamental Graph Theory topics and results. x Be exposed to the techniques of proofs and analysis.
UNIT I INTRODUCTION
Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits –Connectedness – Components – Euler graphs – Hamiltonian paths and circuits – Trees – Properties of trees – Distance and centers in tree – Rooted and binary trees.
UNIT II TREES, CONNECTIVITY & PLANARITY
Spanning trees – Fundamental circuits – Spanning trees in a weighted graph – cut sets – Properties of cut set – All cut sets – Fundamental circuits and cut sets – Connectivity and separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and geometric graphs – Planer graphs – Different representation of a planer graph.
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
Chromatic number – Chromatic partitioning – Chromatic polynomial – Matching – Covering – Four color problem – Directed graphs – Types of directed graphs – Digraphs and binary relations – Directed paths and connectedness – Euler graphs.
UNIT IV PERMUTATIONS & COMBINATIONS
Fundamental principles of counting – Permutations and combinations – Binomial theorem – combinations with repetition – Combinatorial numbers – Principle of inclusion and exclusion – Derangement – Arrangements with forbidden positions.
UNIT V GENERATING FUNCTIONS
Generating functions – Partitions of integers – Exponential generating function – Summation operator – Recurrence relations – First order and second order – Non-homogeneous recurrence relations – Method of generating functions.
TOTAL: 45 PERIODS

OUTCOMES:
Upon Completion of the course, the students should be able to:
x Write precise and accurate mathematical definitions of objects in graph theory.
x Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.
x Validate and critically assess a mathematical proof.
x Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of questions in graph theory.
x Reason from definitions to construct mathematical proofs.
TEXT BOOKS:
1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India, 2003.
2. Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley, 1994.
REFERENCES:
1. Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and Mathematicians” , Prentice Hall of India, 1996.
3. Liu C.L., “Elements of Discrete Mathematics”, Mc Graw Hill, 1985.
4. Rosen K.H., “Discrete Mathematics and Its Applications”, Mc Graw Hill, 2007.

If you require any other notes/study materials, you can comment in the below section.