# JNTUH CSE-AIML GRAPH THEORY SYLLABUS

Pre-requisites: An understanding of Mathematics in general is sufficient.
Course Outcomes:
 Know some important classes of graph theoretic problems;
 Be able to formulate and prove central theorems about trees, matching, connectivity, colouring
and planar graphs;
 Be able to describe and apply some basic algorithms for graphs;
 Be able to use graph theory as a modelling tool.
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
Trees- Definitions and characterizations, Number of trees, Cayley‟s formula, Kircho↵-matrix-tree theorem, Minimum spanning trees, Kruskal‟s algorithm, Prim‟s algorithm, Special classes of graphs, Bipartite Graphs, Line Graphs, Chordal Graphs, Eulerian Graphs, Fleury‟s algorithm, Chinese Postman problem, Hamilton Graphs, Introduction, Necessary conditions and sufficient conditions.
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:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate Texts in Mathematics.Springer, 1st edition, 2008.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.
REFERENCE BOOKS:
1. Lecture Videos: http://nptel.ac.in/courses/111106050/13.
2. Introduction to Graph Theory, Douglas B. West, Pearson.
3. Schaum’s Outlines Graph Theory, Balakrishnan, TMH.
4. Introduction to Graph Theory, Wilson Robin j, PHI.
5. Graph Theory with Applications to Engineering and Computer Science, Narsing Deo, PHI.
6. Graphs – An Introductory Approach, Wilson and Watkins

## CSE-AIML

SEMESTER SUBJECT CODE SUBJECT Lession Plan Lecturer Notes & Question Bank SYLLABUS ABOUT TUTOR
I MA101BS Mathematics – I Click Here
I CS103ES Programming for Problem Solving Click Here
I AP105BS Applied Physics Lab Click Here
I CS106ES Programming for Problem Solving Lab Click Here
II MA201BS Mathematics – II Click Here
II EE203ES Basic Electrical Engineering Click Here
II CH206BS Engineering Chemistry Lab Click Here
II EN207HS English Language and Communication Skills Lab Click Here
II EE208ES Basic Electrical Engineering Lab Click Here
II-I MA313BS Mathematical and Statistical Foundations Click Here
II-I CS304PC Computer Organization and Architecture Click Here
II-I CS307PC Data Structures Lab Click Here
II-I CS312PC Python Programming Lab Click Here
II-I MC309 Gender Sensitization Lab Click Here
II-II CS416PC Formal Language and Automata Theory Click Here
II-II CS404PC Database Management Systems Click Here
II-II CS412PC Object Oriented Programming using Java Click Here
II-II CS406PC Operating Systems Lab Click Here
II-II CS407PC Database Management Systems Lab Click Here
II-II CS408PC Java Programming Lab Click Here
II-II MC409 Constitution of India Click Here
III-I Design and Analysis of Algorithms Click Here
III-I Introduction to Data Science(PE1) Click Here
III-I Information Retrieval Systems(PE2) VIJAYANAND S