Graph Theory detailed syllabus for Computer Science Engineering (CSE), R18 regulation has been taken from the JNTUHs official website and presented for the students of B.Tech Computer Science Engineering branch affiliated to JNTUH course structure. For Course Code, Course Titles, Theory Lectures, Tutorial, Practical/Drawing, Credits, and other information do visit full semester subjects post given below. The syllabus PDF files can also be downloaded from the universities official website.
For all the other CSE 4th Year 1st Sem Syllabus for B.Tech R18 Regulation JNTUH scheme, visit Computer Science Engineering 4th Year 1st Sem R18 Scheme.
For all the (Professional Elective-4) subjects refer to Professional Elective-4 Scheme. The detail syllabus for graph theory is as follows.
Pre-requisites:
- An understanding of Mathematics in general is sufficient.
Course Outcome:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
.
Unit – I
Introduction-Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs, Matrix representations of graphs, Degree of a vertex, Directed walks, paths and cycles, Connectivity in digraphs, Eulerian and Hamilton digraphs, Eulerian digraphs, Hamilton digraphs, Special graphs, Complements, Larger graphs from smaller graphs, Union, Sum, Cartesian Product, Composition, Graphic sequences, Graph theoretic model of the LAN problem, Havel-Hakimi criterion, Realization of a graphic sequence.
Unit – II
Connected graphs and shortest paths – Walks, trails, paths, cycles, Connected graphs, Distance, Cut-vertices and cut-edges, Blocks, Connectivity, Weighted graphs and shortest paths, Weighted graphs, Dijkstra”s shortest path algorithm, Floyd-Warshall shortest path algorithm.
Unit – III
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Unit – IV
Independent sets coverings and matchings- Introduction, Independent sets and coverings: basic equations, Matchings in bipartite graphs, Hall”s Theorem, K”onig”s Theorem, Perfect matchings in graphs, Greedy and approximation algorithms.
Unit – V
Vertex Colorings- Basic definitions, Cliques and chromatic number, Mycielski”s theorem, Greedy coloring algorithm, Coloring of chordal graphs, Brooks theorem, Edge Colorings, Introduction and Basics, Gupta-Vizing theorem, Class-1 and Class-2 graphs, Edge-coloring of bipartite graphs, Class-2 graphs, Hajos union and Class-2 graphs, A scheduling problem and equitable edge-coloring.
Text Books:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier..
Reference Books:
- Lecture Videos: http://nptel.ac.in/courses/111106050/13
- Introduction to Graph Theory, Douglas B. West, Pearson.
- Schaums Outlines Graph Theory, Balakrishnan, TMH
- Introduction to Graph Theory, Wilson Robin j, PHI
- Graph Theory with Applications to Engineering And Computer Science, Narsing Deo, PHI
- Graphs – An Introductory Approach, Wilson and Watkins
For detail syllabus of all other subjects of B.Tech Computer Science Engineering 4th Year 1st Sem , visit CSE 4th Year 1st Sem syllabus subjects.
For B.Tech Computer Science Engineering (CSE) 4th Year results, visit JNTUH B.Tech Computer Science Engineering semester results direct link.