Cs6702 Graph Theory and Applications Syllabus

This document outlines the course objectives, units, and topics for CS6702 GRAPH THEORY AND APPLICATIONS. The 5 units cover: 1) introductory graph theory topics, 2) trees, connectivity, and planarity, 3) matrices, graph colouring, and directed graphs, 4) permutations and combinations, and 5) generating functions. Key topics include graphs, isomorphism, walks, paths, trees, spanning trees, planarity, colouring, and generating functions. The course aims to familiarize students with fundamental graph theory concepts and techniques for proof and analysis.

Uploaded by

appasami

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

100% found this document useful (1 vote)

457 views

Cs6702 Graph Theory and Applications Syllabus

Uploaded by

appasami

Available Formats

Download as DOCX, PDF, TXT or read online on Scribd

You are on page 1/ 5

CS6702

GRAPH THEORY AND APPLICATIONS

LTPC

3003

OBJECTIVES: The student should be made to:

Be familiar with the most fundamental Graph Theory topics and results.
Be exposed to the techniques of proofs and analysis.
UNIT I INTRODUCTION
9
Graphs Introduction Isomorphism Sub graphs Walks, Paths, Circuits
Connectedness Components Euler graphs Hamiltonian paths and circuits Trees
Properties of trees Distance and centers in tree Rooted and binary trees.
UNIT II TREES, CONNECTIVITY & PLANARITY
9
Spanning trees Fundamental circuits Spanning trees in a weighted graph cut sets
Properties of cut set All cut sets Fundamental circuits and cut sets Connectivity and
separability Network flows 1-Isomorphism 2-Isomorphism Combinational and
geometric graphs Planer graphs Different representation of a planer graph.
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
8
Chromatic number Chromatic partitioning Chromatic polynomial Matching
Covering -Four color problem Directed graphs Types of directed graphs Digraphs
and binary relations Directed paths and connectedness Euler graphs.
UNIT IV PERMUTATIONS & COMBINATIONS
9
Fundamental principles of counting - Permutations and combinations - Binomial theorem combinations with repetition - Combinatorial numbers - Principle of inclusion and
exclusion - Derangements - Arrangements with forbidden positions.
UNIT V GENERATING FUNCTIONS
10
Generating functions - Partitions of integers - Exponential generating function
Summation operator - Recurrence relations - First order and second order Nonhomogeneous recurrence relations - Method of generating functions.
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the course, the students should be able to:
Write precise and accurate mathematical definitions of objects in graph theory.
Use mathematical definitions to identify and construct examples and to distinguish
examples from non-examples.
Validate and critically assess a mathematical proof.
Use a combination of theoretical knowledge and independent mathematical
thinking in creative investigation of questions in graph theory.
Reason from definitions to construct mathematical proofs.
TEXT BOOKS:
1. Narsingh Deo, Graph Theory: With Application to Engineering and Computer
Science, Prentice Hall of India, 2003.
2. Grimaldi R.P. Discrete and Combinatorial Mathematics: An Applied Introduction,
Addison Wesley, 1994.
REFERENCES:
1. Clark J. and Holton D.A, A First Look at Graph Theory, Allied Publishers, 1995.
2. Mott J.L., Kandel A. and Baker T.P. Discrete Mathematics for Computer Scientists
and Mathematicians , Prentice Hall of India, 1996.
3. Liu C.L., Elements of Discrete Mathematics, Mc Graw Hill, 1985.
4. Rosen K.H., Discrete Mathematics and Its Applications, Mc Graw Hill, 2007.

UNIT I INTRODUCTION
Graphs
Introduction
Isomorphism
Sub graphs
Walks, Paths, Circuits
Connectedness
Components
Euler graphs
Hamiltonian paths and circuits
Trees
Properties of trees
Distance and centers in tree
Rooted and binary trees
UNIT II TREES, CONNECTIVITY & PLANARITY
Spanning trees
Fundamental circuits
Spanning trees in a weighted graph
cut sets
Properties of cut set
All cut sets
Fundamental circuits and cut sets
Connectivity and separability
Network flows
1-Isomorphism
2-Isomorphism
Combinational and geometric graphs
Planer graphs
Different representation of a planer graph
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
Chromatic number
Chromatic partitioning
Chromatic polynomial
Matching
Covering
Four color problem
Directed graphs
Types of directed graphs
Digraphs and binary relations
Directed paths and connectedness
Euler graphs
UNIT IV PERMUTATIONS & COMBINATIONS
Fundamental principles of counting
Permutations and combinations
Binomial theorem
combinations with repetition
Combinatorial numbers
Principle of inclusion and exclusion
Derangements
Arrangements with forbidden positions

UNIT V GENERATING FUNCTIONS

Generating functions
Partitions of integers
Exponential generating function
Summation operator
Recurrence relations
First order and second order
Non-homogeneous recurrence relations
Method of generating functions

UNIT I INTRODUCTION
1. 1Graphs
1. 2Introduction
1. 3Isomorphism
1. 4Sub graphs
1. 5Walks, Paths, Circuits
1. 6Connectedness
1. 7Components
1. 8Euler graphs
1. 9Hamiltonian paths and circuits
1. 10
Trees
1. 11
Properties of trees
1. 12
Distance and centers in tree
1. 13
Rooted and binary trees
UNIT II TREES, CONNECTIVITY & PLANARITY
2. 1Spanning trees
2. 2Fundamental circuits
2. 3Spanning trees in a weighted graph
2. 4cut sets
2. 5Properties of cut set
2. 6All cut sets
2. 7Fundamental circuits and cut sets
2. 8Connectivity and separability
2. 9Network flows
2. 10
1-Isomorphism
2. 11
2-Isomorphism
2. 12
Combinational and geometric graphs
2. 13
Planer graphs
2. 14
Different representation of a planer graph
UNIT III MATRICES, COLOURING AND DIRECTED GRAPH
3. 1Chromatic number
3. 2Chromatic partitioning
3. 3Chromatic polynomial
3. 4Matching
3. 5Covering
3. 6Four color problem
3. 7Directed graphs
3. 8Types of directed graphs
3. 9Digraphs and binary relations
3. 10
Directed paths and connectedness
3. 11
Euler graphs
UNIT IV PERMUTATIONS & COMBINATIONS
4. 1Fundamental principles of counting
4. 2Permutations and combinations
4. 3Binomial theorem
4. 4Combinations with repetition
4. 5Combinatorial numbers
4. 6Principle of inclusion and exclusion
4. 7Derangements
4. 8Arrangements with forbidden positions

UNIT V GENERATING FUNCTIONS

5. 1Generating functions
5. 2Partitions of integers
5. 3Exponential generating function
5. 4Summation operator
5. 5Recurrence relations
5. 6First order and second order
5. 7Non-homogeneous recurrence relations
5. 8
Method of generating functions.