Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
2K views2 pages

Graph Theory

This document outlines the syllabus for a Graph Theory course offered through NPTEL. The course covers topics like paths and circuits in graphs, trees and fundamental circuits, matrix representations of graphs, planar and dual graphs, coloring of planar graphs, and graph algorithms. It includes 6 hours of instruction on introduction to graphs, 5 hours on paths and circuits, 8 hours on trees and fundamental circuits, and so on for each topic. References and prerequisites are also provided. The course is coordinated by professors from IIT Roorkee's mathematics department and is part of a joint venture between IISc and IITs funded by the MHRD.

Uploaded by

Vivek Anand
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2K views2 pages

Graph Theory

This document outlines the syllabus for a Graph Theory course offered through NPTEL. The course covers topics like paths and circuits in graphs, trees and fundamental circuits, matrix representations of graphs, planar and dual graphs, coloring of planar graphs, and graph algorithms. It includes 6 hours of instruction on introduction to graphs, 5 hours on paths and circuits, 8 hours on trees and fundamental circuits, and so on for each topic. References and prerequisites are also provided. The course is coordinated by professors from IIT Roorkee's mathematics department and is part of a joint venture between IISc and IITs funded by the MHRD.

Uploaded by

Vivek Anand
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

NPTEL Syllabus

Graph Theory - Web course

COURSE OUTLINE

1. Introduction to Graphs

NPTEL
2. Paths and Circuits

3. Trees and Fundamental circuits

4. Matrix representation of graphs http://nptel.iitm.ac.in

5. Planar and Dual graph


Mathematics
6. Coloring of planar graphs

7. Graph Algorithms

COURSE DETAIL Pre-requisites:

Elementary Theory of Matrices


Particulars Hours

Additional Reading:
Introduction to Graphs: Definition of a graph and directed 6
graph, simple graph. Degree of a vertex, regular graph, 1. West Denglas B., Introduction to
bipartite graphs, subgraphs, complete graph, complement of Graph Theory, Pearson
a graph, operations of graphs, isomorphism and Education,2002.
homomorphism between two graphs, directed graphs and
relations. 2. G. Agnarsson and R. Greenlaw, Graph
Theory : Modeling, Applications and
Algorithms, Pearson Education,2007.
Paths and Circuits: Walks, paths and circuits, 5
connectedness of a graph, Disconnected graphs and their
components, Konigsberg 7-bridge problem, Around the Hyperlinks:
world problem, Euler graphs, Hamiltonian paths and circuits,
Existence theorem for Eulerian and Hamiltonian graphs. 1. en.wikipedia.org/wiki/Graph_theory

2. books.google.co.in
Trees and Fundamental circuits: Trees and their 8
properties, distance and centre in a tree and in a graph,
rooted and binary trees, spanning trees and forest, Coordinators:
fundamental circuits, cut sets, connectivity and Prof. R.C. Mittal
separability,1-isomorphism, 2-isomorphism, breadth first and Department of Mathematics IIT Roorkee
depth first search.
Prof. S.P. Sharma
Department of Mathematics IIT Roorkee
Matrix representation of graphs: Incidence matrix and its 6
sub matrices, Reduced incidence matrix, circuit matrix,
fundamental circuit matrix, cut set matrix, fundamental cut
set matrix, path matrix, adjacency matrix of a graph and of
digraph.

Planar and Dual graph: Planar graphs, Euler’s formula, 5


Kuratowski’s graphs, detections of planarity, geometric dual,
combinatorial dual.

Coloring of planar graphs: Chromatic number, 6


independent set of vertices, maximal independent set,
chromatic partitioning, dominating set, minimal dominating
set, chromatic polynomial, coloring and four colour problem,
coverings, machings in a graph.

Graph Algorithms: Network flows, Ford-Fulkerson 4


algorithm for maximum flow, Dijkstra algorithm for shortest
path between two vertices, Kruskal and Prim’s algorithms
for minimum spanning tree.
References:

1. Deo Narsingh, Graph Theory with Applications to engineering and


computer science, Prentice Hall of India, 1992.

2. Clark John and Holton D.A., A first Look At Graph Theory, Allied
Publishers Ltd., New Delhi,1995.

3. Aldous and Wilson, Graphs and Applications: An Introductory Approach,


Springer,2000.

4. Mott J.L., Kandel A and Baker T.P., . Discrete Mathematics for Computer
Scientists and Mathematicians, Prentice Hall of India,2001.

5. Reinhard Diestel, Graph Theory, Springer International Edition..2004

A joint venture by IISc and IITs, funded by MHRD, Govt of India http://nptel.iitm.ac.in

You might also like