CS8077 - GRAPH THEORY AND APPLICATIONS (Syllabus) 2017-regulation Anna University

CS8077 - GRAPH THEORY AND APPLICATIONS (Syllabus) 2017-regulation Anna University

CS8077

GRAPH THEORY AND APPLICATIONS

 LPTC
3003

OBJECTIVES:
• To understand fundamentals of graph theory.
• To study proof techniques related to various concepts in graphs.
• To explore modern applications of graph theory.

UNIT I

9
Introduction - Graph Terminologies - Types of Graphs - Sub Graph- Multi Graph - Regular Graph - Isomorphism - Isomorphic Graphs - Sub-graph - Euler graph - Hamiltonian Graph - Related Theorems.

UNIT II

9
Trees -Properties- Distance and Centres - Types - Rooted Tree-- Tree Enumeration- Labeled Tree - Unlabeled Tree - Spanning Tree - Fundamental Circuits- Cut Sets - Properties - Fundamental Circuit and Cut-set- Connectivity- Separability -Related Theorems.


UNIT III

9
Network Flows - Planar Graph - Representation - Detection - Dual Graph - Geometric and Combinatorial Dual - Related Theorems - Digraph - Properties - Euler Digraph.

UNIT IV

9
Matrix Representation - Adjacency matrix- Incidence matrix- Circuit matrix - Cut-set matrix - Path Matrix- Properties - Related Theorems - Correlations. Graph Coloring - Chromatic Polynomial - Chromatic Partitioning - Matching - Covering - Related Theorems.

UNIT V

9
Graph Algorithms- Connectedness and Components- Spanning Tree- Fundamental Circuits- Cut Vertices- Directed Circuits- Shortest Path - Applications overview.

TOTAL: 45 PERIODS

OUTCOMES: Upon completion of this course, the students should be able to
• Understand the basic concepts of graphs, and different types of graphs
• Understand the properties, theorems and be able to prove theorems.
• Apply suitable graph model and algorithm for solving applications.

TEXT BOOKS:
1. Narsingh Deo, "Graph Theory with Application to Engineering and Computer Science", Prentice-Hall of India Pvt.Ltd, 2003.
2. L.R.Foulds , "Graph Theory Applications", Springer ,2016.

REFERENCES:
1. Bondy, J. A. and Murty, U.S.R., "Graph Theory with Applications", North Holland Publication,2008.
2. West, D. B., ―Introduction to Graph Theory‖, Pearson Education, 2011.
3. John Clark, Derek Allan Holton, ―A First Look at Graph Theory‖, World Scientific Publishing Company, 1991.
4. Diestel, R, "Graph Theory", Springer,3rd Edition,2006.
5. Kenneth H.Rosen, "Discrete Mathematics and Its Applications", Mc Graw Hill , 2007.
Previous
Next

Comments

Post a Comment

Popular posts from this blog

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University

CS3491 Syllabus - Artificial Intelligence And Machine Learning - 2021 Regulation Anna University CS3491 ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING  LTPC 3024 COURSE OBJECTIVES: • The main objectives of this course are to: • Study about uninformed and Heuristic search techniques. • Learn techniques for reasoning under uncertainty • Introduce Machine Learning and supervised learning algorithms • Study about ensembling and unsupervised learning algorithms • Learn the basics of deep learning using neural networks We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I PROBLEM SOLVING 9 Introduction to AI - AI Applications - Problem solving agents – search algorithms – uninformed
Read more

BE3251 - Basic Electrical and Electronics Engineering (Syllabus) 2021-regulation Anna University

BE3251 - Basic Electrical and Electronics Engineering (Syllabus) 2021-regulation Anna University BE3251 Basic Electrical and Electronics Engineering  LPTC 3003 COURSE OBJECTIVES: • To introduce the basics of electric circuits and analysis • To impart knowledge in the basics of working principles and application of electrical machines • To introduce analog devices and their characteristics • To educate on the fundamental concepts of digital electronics • To introduce the functional elements and working of measuring instruments We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I ELECTRICAL CIRCUITS 9 DC Circuits: Circuit Components: Conductor, Resistor, Inductor, Capacitor – Ohm’s Law - Kirchhoff’s Laws –Independent and Dependent Sources – Simple problems- Nodal Analysis, Mesh analysis with Independent sources only (Steady state) Introd
Read more

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University

CS3401 Syllabus - Algorithms - 2021 Regulation Anna University CS3401 ALGORITHMS  LTPC 3024 COURSE OBJECTIVES: • To understand and apply the algorithm analysis techniques on searching and sorting algorithms • To critically analyze the efficiency of graph algorithms • To understand different algorithm design techniques • To solve programming problems using state space tree • To understand the concepts behind NP Completeness, Approximation algorithms and randomized algorithms. We're excited to announce the launch of our new website! Visit NameWheelSpinner.com to explore its features and benefits. UNIT I INTRODUCTION 9 Algorithm analysis: Time and space complexity - Asymptotic Notations and its properties Best case, Worst case and average case analys
Read more