Graph Theory and Applications Syllabus for B.Tech 8th sem is covered here. This gives the details about credits, number of hours and other details along with reference books for the course.
The detailed syllabus for Graph Theory and Applications B.Tech (R13) eightsem is as follows
OBJECTIVES: The student should be made to:
- Be familiar with the most fundamental Graph Theory topics and results.
- Be exposed to the techniques of proofs and analysis.
UNIT I : INTRODUCTION [9 hours]
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 [9 hours]
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 [8 hours]
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.
Download iStudy Android App for complete Anna University syllabus, results, timetables and all other updates. There are no ads and no pdfs and will make your life way easier.
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
- Write precise and accurate mathematical definitions of objects in graph theory.
- Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.
- Validate and critically assess a mathematical proof.
- Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of questions in graph theory.
- Reason from definitions to construct mathematical proofs.
TEXT BOOKS:
- Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India, 2003.
- Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley, 1994.
REFERENCES:
- Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers, 1995.
- Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and Mathematicians” , Prentice Hall of India, 1996.
- Liu C.L., “Elements of Discrete Mathematics”, McGraw Hill, 1985.
- Rosen K.H., “Discrete Mathematics and Its Applications”, McGraw Hill, 2007.
For all other B.Tech IT 8th sem syllabus go to Anna University B.Tech Information Technology (IT) 8th Sem Course Structure for (R13) Batch. All details and yearly new syllabus will be updated here time to time.
Do share with friends and in case of questions please feel free drop a comment.