Scribd
Upload
15 views2 pages

Graph Theory

The document outlines a course on Graph Theory, detailing its objectives, outcomes, and content structure. Key topics include graph models, trees, Eulerian and Hamiltonian graphs, graph coloring, and optimization algorithms. The course aims to equip students with practical skills in applying graph concepts to real-world problems.

Uploaded by

Nuthal Srinivasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views2 pages

Graph Theory

The document outlines a course on Graph Theory, detailing its objectives, outcomes, and content structure. Key topics include graph models, trees, Eulerian and Hamiltonian graphs, graph coloring, and optimization algorithms. The course aims to equip students with practical skills in applying graph concepts to real-world problems.

Uploaded by

Nuthal Srinivasan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

2303EC043 GRAPH THEORY L T P C

3 0 0 3
PREREQUISITE:

COURSE OBJECTIVES:

To understand the graph models and basic concepts of graphs.


To study the characterization and properties of trees and graph connectivity.
To provide an exposure to the Eulerian and Hamiltonian graphs.
To introduce Graph colouring and explain its significance.
To provide an understanding of Optimization Graph Algorithms.

COURSE OUTCOMES:

On the successful completion of the course, students will be able to


CO1: Apply graph models for solving real world problem.
CO2: Understand the importance the natural applications of trees and graph connectivity.
CO3: Understand the characterization study of Eulerian graphs and Hamiltonian graphs.
CO4: Apply the graph colouring concepts in partitioning problems.
CO5: Apply the standard optimization graph algorithms in solving application problems.

COs Vs POs MAPPING:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 3
CO2 2 2 2
CO3 2 2 2 2
CO4 2 2 2
CO5 3 2 2 3

COs Vs PSOs MAPPING:

COs PSO1 PSO2


CO1
CO2
CO3
CO4
CO5

COURSE CONTENTS:

MODULE I INTRODUCTION TO GRAPHS 9 Hours


Graphs and Graph Models – Connected graphs – Common classes of graphs – Multi graphs and Digraphs –
Degree of a vertex – Degree Sequence – Graphs and Matrices – Isomorphism of graphs.
MODULE II TREE AND CONNECTIVITY 9 Hours
Bridges – Trees – Characterization and properties of trees – Cut vertices – Connectivity.
MODULE III TRAVERSABILITY 9 Hours
Eulerian graphs – Characterization of Eulerian graphs – Hamiltonian graphs – Necessary condition for
Hamiltonian graphs – Sufficient condition for Hamiltonian graphs.
MODULE IV PLANARITY AND COLOURING 9 Hours
Planar Graphs – The Euler Identity – Non planar Graphs – Vertex Colouring – Lower and Upper bounds of
chromatic number.
MODULE V OPTIMIZATION GRAPH ALGORITHMS 9 Hours
Dijkstra’s shortest path algorithm – Kruskal’s and Prim’s minimum spanning tree algorithms – Transport
Network – The Max-Flow Min-Cut Theorem – The Labeling Procedure – Maximum flow problem.
TOTAL: 45 HOURS

REFERENCES:

1. Gary Chatrand and Ping Zhang, “Introduction to Graph Theory”, Tata McGraw – Hill companies
Inc., New York, 2006.
2. Ralph P. Grimaldi, “Discrete and Combinatorial Mathematics, An applied introduction", Fifth
Eedition, Pearson Education, Inc, Singapore, 2004.
3. Balakrishnan R. and Ranganathan K., “A Text Book of Graph Theory”,
Springer – Verlag, New York, 2012.
4. Douglas B. West, “Introduction to Graph Theory”, Pearson, Second Edition, New York, 2018.

You might also like