{"id":338,"date":"2016-11-04T08:06:04","date_gmt":"2016-11-04T08:06:04","guid":{"rendered":"http:\/\/www.inspirenignite.com\/anna-university\/?p=338"},"modified":"2019-07-17T07:08:08","modified_gmt":"2019-07-17T07:08:08","slug":"anna-university-b-tech-it-r13-8th-graph-theory-and-applications-detailed-syllabus","status":"publish","type":"post","link":"https:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-it-r13-8th-graph-theory-and-applications-detailed-syllabus\/","title":{"rendered":"Anna University B.Tech IT (R13) 8th Graph Theory and Applications Detailed Syllabus"},"content":{"rendered":"<p>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.<\/p>\n<p>The detailed syllabus for Graph Theory and Applications B.Tech (R13) eightsem is as follows<\/p>\n<p><strong>OBJECTIVES<\/strong>: The student should be made to:<\/p>\n<ul>\n<li>Be familiar with the most fundamental Graph Theory topics and results.<\/li>\n<li>Be exposed to the techniques of proofs and analysis.<\/li>\n<\/ul>\n<p><strong>UNIT I : INTRODUCTION<\/strong>\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 [9 hours]<br \/>\nGraphs \u2013 Introduction \u2013 Isomorphism \u2013 Sub graphs \u2013 Walks, Paths, Circuits \u2013Connectedness \u2013 Components \u2013 Euler graphs \u2013 Hamiltonian paths and circuits \u2013 Trees \u2013 Properties of trees \u2013 Distance and centers in tree \u2013 Rooted and binary trees.<\/p>\n<p><strong>UNIT II : TREES, CONNECTIVITY &amp; PLANARITY<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0[9 hours]<br \/>\nSpanning trees \u2013 Fundamental circuits \u2013 Spanning trees in a weighted graph \u2013 cut sets \u2013 Properties of cut set \u2013 All cut sets \u2013 Fundamental circuits and cut sets \u2013 Connectivity and separability \u2013 Network flows \u2013 1-Isomorphism \u2013 2-Isomorphism \u2013 Combinational and geometric graphs \u2013 Planer graphs \u2013 Different representation of a planer graph.<\/p>\n<p><strong>UNIT III : MATRICES, COLOURING AND DIRECTED GRAPH<\/strong> \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0\u00a0[8 hours]<br \/>\nChromatic number \u2013 Chromatic partitioning \u2013 Chromatic polynomial \u2013 Matching \u2013 Covering \u2013 Four color problem \u2013 Directed graphs \u2013 Types of directed graphs \u2013 Digraphs and binary relations \u2013 Directed paths and connectedness \u2013 Euler graphs.<\/p>\n<p style=\"text-align: center\"><strong><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">Download iStudy<\/a> <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\">Android<\/a><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=ini.istudy\" target=\"_blank\" rel=\"noopener\"> 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.<\/a><\/strong><\/p>\n<p><strong>TOTAL: 45 PERIODS<\/strong><\/p>\n<p><strong>OUTCOMES:<\/strong><br \/>\nUpon Completion of the course, the students should be able to:<\/p>\n<ul>\n<li>Write precise and accurate mathematical definitions of objects in graph theory.<\/li>\n<li>Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.<\/li>\n<li>Validate and critically assess a mathematical proof.<\/li>\n<li>Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of questions in graph theory.<\/li>\n<li>Reason from definitions to construct mathematical proofs.<\/li>\n<\/ul>\n<p><strong>TEXT BOOKS:<\/strong><\/p>\n<ul>\n<li>Narsingh Deo, \u201cGraph Theory: With Application to Engineering and Computer Science\u201d, Prentice Hall of India, 2003.<\/li>\n<li>Grimaldi R.P. \u201cDiscrete and Combinatorial Mathematics: An Applied Introduction\u201d, Addison Wesley, 1994.<\/li>\n<\/ul>\n<p><strong>REFERENCES:<\/strong><\/p>\n<ul>\n<li>Clark J. and Holton D.A, \u201cA First Look at Graph Theory\u201d, Allied Publishers, 1995.<\/li>\n<li>Mott J.L., Kandel A. and Baker T.P. \u201cDiscrete Mathematics for Computer Scientists and Mathematicians\u201d , Prentice Hall of India, 1996.<\/li>\n<li>Liu C.L., \u201cElements of Discrete Mathematics\u201d, McGraw Hill, 1985.<\/li>\n<li>Rosen K.H., \u201cDiscrete Mathematics and Its Applications\u201d, McGraw Hill, 2007.<\/li>\n<\/ul>\n<p>For all other B.Tech IT 8th sem syllabus go to <a href=\"http:\/\/www.inspirenignite.com\/anna-university\/anna-university-b-tech-information-technology-8th-sem-course-structure-for-r13-batch\/\">Anna University B.Tech Information Technology (IT) 8th Sem Course Structure for (R13) Batch.\u00a0<\/a>All details and yearly new syllabus will be updated here time to time.<\/p>\n<p>Do share with friends and in case of questions please feel free drop a comment.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>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 [&hellip;]<\/p>\n","protected":false},"author":2259,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_bbp_topic_count":0,"_bbp_reply_count":0,"_bbp_total_topic_count":0,"_bbp_total_reply_count":0,"_bbp_voice_count":0,"_bbp_anonymous_reply_count":0,"_bbp_topic_count_hidden":0,"_bbp_reply_count_hidden":0,"_bbp_forum_subforum_count":0,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-338","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/338","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/users\/2259"}],"replies":[{"embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/comments?post=338"}],"version-history":[{"count":2,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/338\/revisions"}],"predecessor-version":[{"id":10617,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/posts\/338\/revisions\/10617"}],"wp:attachment":[{"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/media?parent=338"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/categories?post=338"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.inspirenignite.com\/anna-university\/wp-json\/wp\/v2\/tags?post=338"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}