sc JNTUH B.TECH R18 4-1 Syllabus For Graph theory PDF 2022 – Cynohub

# JNTUH B.TECH R18 4-1 Syllabus For Graph theory PDF 2022

### Get Complete Lecture Notes for Graph theory on Cynohub APP

You will be able to find information about Graph theory along with its Course Objectives and Course outcomes and also a list of textbook and reference books in this blog.You will get to learn a lot of new stuff and resolve a lot of questions you may have regarding Graph theory after reading this blog. Graph theory has 5 units altogether and you will be able to find notes for every unit on the CynoHub app. Graph theory can be learnt easily as long as you have a well planned study schedule and practice all the previous question papers, which are also available on the CynoHub app.

All of the Topic and subtopics related to Graph theory are mentioned below in detail. If you are having a hard time understanding Graph theory or any other Engineering Subject of any semester or year then please watch the video lectures on the official CynoHub app as it has detailed explanations of each and every topic making your engineering experience easy and fun.

### Graph theory Unit One

#### 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.

### Graph theory Unit Two

#### 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.

### Graph theory Unit Three

#### 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.

### Graph theory Unit Four

#### 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.

### Graph theory Unit Five

#### 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.

COMING SOON

### Graph theory 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.

### Graph theory Text Books

J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate Texts in Mathematics. Springer, 1st edition, 2008.
J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.

### Graph theory Reference Books

Lecture Videos: http://nptel.ac.in/courses/111106050/13
Introduction to Graph Theory, Douglas B. West, Pearson.

Schaum’s 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