Scribd
Upload
132 views2 pages

Course Work Syllabus Basic Graph Theory

Uploaded by

Seema varghese
Copyright
© © All Rights Reserved
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
132 views2 pages

Course Work Syllabus Basic Graph Theory

Uploaded by

Seema varghese
Copyright
© © All Rights Reserved
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

Ph.

D Course Work

Basic Graph Theory


Teaching scheme Credits: 4 Year: 2019-20
4 hours lecture per week

Prerequisites:
Basic knowledge of Graphs, Matrix algebra

Course Objectives:
The paper is intended to understand concept of graph as a mathematical model.

Syllabus
Graphs, , Paths , Line Graphs, Operations on Graphs, Graph Products, Directed Graphs , Vertex Cuts,
Edges Cuts ,Connectivity, Blocks, Trees, Shortest-Path Problems, Vertex-Independent Sets, Vertex
Coverings, Edge-Independent Sets, Matchings, Factors, Eulerian Graphs, Hamiltonian Graphs, Vertex
Colorings , Planar Graphs, Euler Formula, Perfect Graphs ,Triangulated Graphs, Interval Graphs,
Bipartite Graph of a Graph , Circular Arc Graph.

Course Outcomes:
At the end of the course, the student is expected to be able to
 Model real world problems using graphs.
 Apply different solving methods.
Text:
 R. Balakrishnan, K. Ranganathan, A Textbook of Graph Theory, Second Edition, Springer
References:
1. Douglas B. West, Introduction to Graph Theory Prentice- Hall, New Delhi (1999)
2. John Clarke and D.A. Holton, A First Look at Graph Theory, Allied Publisher(1991)
3. Harary, Graph Theory, Narosa Publishers, New Delhi (1989)
COURSE PLAN
COURSE NO: Basic Graph Theory

(L-T-P: 4-0-0)
CREDITS: 4
Sem.
Contact
Modules Contents Exam
Hours
Marks: %
Graphs,Subgraphs, Degrees of Vertices,Paths and
Connectedness,Line Graphs,Operations on Graphs,
I 8 15
Graph Products, Directed Graphs , Vertex Cuts, Edges
Cuts ,Connectivity, Edge Connectivity, Blocks.
Trees-Definition, Characterization and Simple Properties,
Centers,Counting the Number of Spanning Trees Cayley’s
II 6 15
Formula,Kruskal’s Algorithm,Prim’s Algorithm ,
Shortest-Path Problems,Dijkstra’s Algorithm
FIRST INTERNAL TEST
Vertex-Independent Sets, Vertex Coverings,Edge-
III Independent Sets,Matchings Factors,Eulerian Graphs, 8 15
Hamiltonian Graphs
Vertex Colorings , Critical Graphs, Triangle-Free Graphs
IV Edge Colorings of Graphs, Vizing’s Theorem, Snarks, 6 15
Chromatic Polynomials
SECOND INTERNAL TEST
Planar Graphs, Euler Formula and Its Consequences, K5
and K 3,3 are Nonplanar Graphs, Four color Theorem,
V 8 20
Heawood Five Color Theorem, Dual of a Plane Graph,
Kuratowski’s Theorem
Perfect Graphs , Triangulated Graphs , Interval Graphs,
VI Bipartite Graph of a Graph , Circular Arc Graph 6 20

END SEMESTER EXAMINATION

Internal continuous assessment: 40 marks


Assessment procedure:
i) Two internal tests, each having 15 marks
ii) Tutorials/Assignments having 10 mark
The assessment details are to be announced right at the beginning of the semester by the faculty.
End Semester Examination: 60 marks

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy