Scribd
Upload
422 views

Graph Theory

The document outlines the syllabus for a course on graph theory. It is divided into 4 units covering various topics related to graphs over 33 periods. The first unit covers basic graph concepts like walks, paths, circuits and graph operations. The second unit discusses trees, spanning trees, and algorithms. Planar graphs, vector representation, and matrix representation are covered in the third unit. The final unit is not detailed. The periods, reference materials and topics for tutorials and labs are provided. The faculty name is also listed.

Uploaded by

Donald Manning
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
422 views

Graph Theory

The document outlines the syllabus for a course on graph theory. It is divided into 4 units covering various topics related to graphs over 33 periods. The first unit covers basic graph concepts like walks, paths, circuits and graph operations. The second unit discusses trees, spanning trees, and algorithms. Planar graphs, vector representation, and matrix representation are covered in the third unit. The final unit is not detailed. The periods, reference materials and topics for tutorials and labs are provided. The faculty name is also listed.

Uploaded by

Donald Manning
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Syllabus for third sessional are marked in RED colour

GRAPH THEORY (ECS-505)


S.No. Lesson/ Topic Covered Periods Ref Tutorial Topic Tut /Lab Lab Work

UNIT-I
1 2 3 4 5 6 Preamble, Graphs, Sub graphs, application of graph Some basic properties, various example of graphs & their sub graphs, Isomorphism Walks, path & circuits, connected graphs, disconnected graphs and component, Euler graphs, Unicursal Graph Various operation on graphs, Hamiltonian paths and circuits, the traveling sales man problem. 1 1 1 1 1 1 N-1.1, N-1.2 N-1.3,N-1.4, N-1.5, N-2.1, N-2.2 N-2.4, N-2.5 N-2.6 N-2.7 N-2.9 Graph, Subgraph, Isomorphism, Application of graph in Computer Science N/A 1 N/A N/A Euler Graph, Unicursal Graph Hamilton circuit & its application 2 N/A N/A N/A

UNIT- II
7 8 9 10 11 12 Trees & properties of tree Distance diameters, radius and pendent vertices Rooted and binary trees,& Their properties Spanning trees & its properties Fundamental circuits, finding all spanning trees of a graph and a weighted graph, Algorithms of primes, Kruskal and Dijkstra Algorithms. 2 1 1.5 1.5 2 1 N-3.1, N-3.2 N-3.3, N-3.4 N-3.5, N-3.6 N-3.7, N-3.9 N-3.8, N-3.10 S-14.3, S-13.10 Tree, Binary Tree & Spanning Tree Fundamental circuit & weighted graph based on F.C 3 4 5 Tree as a graph & its attributes N/A N/A N/A N/A N/A N/A

UNIT-3
13 14 15 16 17 18 19 20 21 22 Cuts sets and cut vertices, Some properties All cut sets in a graph, fundamental circuits and cut sets , Connectivity and separability, network flows ,1isomorphism, 2-isomorphism Planer graphs, combinatorial and geometric dual: Kuratowski graphs, detection of planarity, geometric dual, Discussion on criterion of planarity, thickness and crossings. Vector space of a graph and vectors, Basis vector, cut set vector, circuit vector, Circuit and cut set subspaces, Matrix representation of graph Basic concepts; Incidence matrix, Circuit matrix, Path matrix, Cut-set matrix and Adjacency matrix. Chromatic number, chromatic partitioning, Chromatic polynomials, Matching, covering, four color problem, 1 1 1 1 1.5 1.5 2 1 1 2 N-4.1, N-4.2 N-4.3, N-4.4 N-4.5, N-4.6, N-4.7, N-4.8 N5.7,N5.4 N-5.3, N-5.5, N-5.6 N5.8,N5.9 N-6.1, N-6.2., N-6.3 N-6.4, N-6.5, N-6.6 N-6.7, N-6.8 N-7.1, N-7.2, N-7.4, N-7.6, N-7.7, N-7.8, N-7.9 N-8.1, N-8.2 N-8.3 N-8.4, N-8.5 Cut sets and Cut vertices N/A 6 N/A N/A N/A Planar graph, Detection of planarity, Geometrical dual 7 N/A N/A N/A Vector space, Cut set vector & circuit vector Circuit and cutest subspace, Matrix Representation of graph Coloring of a graph, chromatic number, chromatic polynomials Four color theorem 8 N/A N/A 9 N/A N/A

UNIT-4

23 24 25

1 1 1

10

N/A N/A N/A

Total Lecture(Hours)

33

10

N- Deo, N, Graph theory with applications to Engineering and Computer Science, PHI- 2010 edition S- Sarkar Swapan K,Discrete Mathematics,S.Chand- First edition

Faculty Name: Nagresh Kumar

You might also like