Lovely Professional University, Punjab

Course Code CSE223 Course Category Course Title GRAPH THEORY Courses with numerical and conceptual focus Course Planner 14557::Avinash Kaur Lectures 3.0 Tutorials Practicals Credits 0.0 0.0 3.0

TextBooks Sr No T-1 Title Graph Theory Reference Books Sr No R-1 R-2 R-3 Other Reading Sr No OR-1 OR-2 OR-3 OR-4 OR-5 Journals articles as Compulsary reading (specific articles, complete reference) http://www.utm.edu/departments/math/graph/ , http://cr.yp.to/2005-261/bender2/GT.pdf , http://cs.bme.hu/fcs/graphtheory.pdf , http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0118 , http://www.personal.kent.edu/~rmuhamma/GraphTheory/graphTheory.htm , Title Graph Theory D. B. West Graph Theory Author Russell Merris Introduction to Graph Theory V.K. Balakrishnan Edition 1st 2nd 1st Year 2013 2004 1997 Publisher Name Wiley Interscience, New York. PHI (Pretice Hall India) Schaum Series McGraw Hill Author J. A. Bondy and U. S. R. Murty Edition 1st Year 2008 Publisher Name Springer

Relevant Websites Sr No RW-1 RW-2 RW-3 RW-4 RW-5 RW-6 RW-7 (Web address) (only if relevant to the course) http://www.princeton.edu/~achaney/tmve/wiki100k/docs/Euler_s_theorem.html http://mathworld.wolfram.com/CompleteBipartiteGraph.html http://www3.ul.ie/cemtl/pdf%20files/cm2/CompleteGraph.pdf http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html http://vlsicad.eecs.umich.edu/BK/SAUCY/papers/Cameron2001.pdf http://cs.anu.edu.au/publications/eljc/Volume_17/PDF/v17i1r134.pdf http://www.math.smith.edu/~rhaas/papers/Trees.pdf Salient Features Eulerian Theorem Bipartite Graph Complete Graph Regular Graph Automorphism Groups Automorphism Groups and Reconstruction Problem Arboricity

RW-8 RW-9 RW-10

http://www.princeton.edu/~achaney/tmve/wiki100k/docs/Euler_s_theorem.html http://www.cut-the-knot.org/do_you_know/CrossingNumber.shtml http://web.itu.edu.tr/~gencata/courses/GT/GTlecture10.pdf

Euler's Theorem Crossing number and Thickness Decompostion and Domination

Audio Visual Aids Sr No AV-1 AV-2 AV-3 AV-4 (AV aids) (only if relevant to the course) http://freevideolectures.com/Course/3019/Graph-Theory http://www.nptel.iitm.ac.in/courses/106108054/ http://freevideolectures.com/Course/2768/MA-103-Topics-in-ContemporaryMathematics/17 http://www.cs.washington.edu/education/courses/cse421/06au/video/index.html Salient Features Vertex Cover and Independent set Various Topics of Graph Theory Temporary Mathematics Graph Theory

Software/Equipments/Databases Sr No SW-1 (S/E/D) (only if relevant to the course) Prolog Salient Features

LTP week distribution: (LTP Weeks) Weeks before MTE Weeks After MTE Spill Over 7 7 3

Detailed Plan For Lectures

Week Number Lecture Number Broad Topic(Sub Topic) Chapters/Sections of Text/reference books Other Readings, Lecture Description Relevant Websites, Audio Visual Aids, software and Virtual Labs Learning Outcomes Pedagogical Tool Demonstration/ Case Study / Images / animation / ppt etc. Planned Peer Learning , Discussion,Slides

Week 1

Lecture 1

Basics(Graphs)

T-1:Chapter 1 sec 1.1 R-3:Chapter 1 sec 1.1 1.2 T-1:Chapter 1 sec 1.1 R-3:Chapter 1 sec 1.1 1.2 T-1:Chapter 1 sec 1.1 T-1:Chapter 1 sec 1.1

Introduction to the Graph Students comes to Theory know about the basics of graph theory Introduction to the Graph Students comes to Theory know about the basics of graph theory Basics of degree sequences Basics of degree sequences Understanding of the degree consequences Understanding of the degree consequences

Lecture 2

Basics(Graphs)

Peer Learning , Discussion,Slides

Lecture 3 Week 2 Lecture 4

Basics(degree sequences) Basics(degree sequences)

Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Week 2

Lecture 5

Basics(distance in graphs)

R-3:Chapter 1 sec 1.1 1.2 1.3 R-3:Chapter 1 sec 1.1 1.2 1.3 R-3:Chapter 1 RW-3

Distance in Graphs

Understanding of distance in graph Understanding of distance in graph

Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Lecture 6

Basics(distance in graphs)

Distance in Graphs

Week 3

Lecture 7

Basics(complete graph)

Introduction to complete Students comes to graph know the complete graph Introduction to complete Students comes to graph know the complete graph Regular and Bipartite graph Properties of Graphs To understanding two types regular and bipartite graphs Understanding of different properties of graphs Students comes to know about the cut vertices Students comes to know about the cut vertices

Lecture 8

Basics(complete graph)

R-3:Chapter 1

RW-3

Lecture 9

Basics(regular and bipartite graphs) Basics(basic properties.)

R-3:Chapter 1

RW-2 RW-4

Week 4

Lecture 10

R-3:Chapter 1

Lecture 11

Structure and Symmetry(Cut vertices) Structure and Symmetry(Cut vertices) Structure and Symmetry(bridges and blocks)

T-1:Chapter 5 sec 5.1

Introduction to cut vertices Introduction to cut vertices Bridge and Block in the graphs, Lecture 13 considered as contingency lecture

Lecture 12

T-1:Chapter 5 sec 5.1

Week 5

Lecture 13

T-1:Chapter 5 sec 5.2

Understanding the Peer Learning , construction of the Discussion,Slides bridges and blocks in the graphs,Topic to be covered in lecture 12 and Test to be scheduled in lecture 13 Basic understanding and use of automorphism groups Peer Learning , Discussion,Slides

Lecture 14 Lecture 15 Structure and Symmetry (automorphism groups) Structure and Symmetry (reconstruction problem.) Trees and connectivity(Properties of trees) Trees and connectivity(Properties of trees) Trees and connectivity(Arboricity) T-1:Chapter 4 sec 4.1 4.2 4.3 4.4 T-1:Chapter 4 sec 4.1 4.2 4.3 4.4 RW-7 RW-5 RW-6 RW-6

Quiz,Test 2 Introduction to the automorphism groups Problem reconstruction

Week 6

Lecture 16

Understanding of Peer Learning , reconstruction problem Discussion,Slides in graphs Understanding the Peer Learning , properties and their use Discussion,Slides in graph Understanding the Peer Learning , properties and their use Discussion,Slides in graph

Lecture 17

Different properties of trees Different properties of trees

Lecture 18

Week 7

Lecture 19

Introduction to arboricity student comes to know Peer Learning , about the arboricity in Discussion,Slides the graphs theory

Week 7

Lecture 20

Trees and connectivity(vertex and T-1:Chapter 9 sec 9.1 edge connectivity) 9.2 9.3 Trees and connectivity(Mengers theorem.) T-1:Chapter 7 sec 7.3

Vertex and edge connectivity in graph theory

Understanding of the vertex and edge connectivity

Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Lecture 21

Mengers theorem, Mengers theorem Lecture 21 considered as explanation contingency lecture

MID-TERM
Week 8 Lecture 22 Eulerian and Hamiltonian graphs (Characterization of Eulerian graphs) Eulerian and Hamiltonian graphs (Sufficient conditions for Hamiltonian graphs.) Colouring and planar graphs (Vertex and edge colouring) Colouring and planar graphs (Vertex and edge colouring) Colouring and planar graphs (perfect graphs) Lecture 26 Colouring and planar graphs (perfect graphs) T-1:Chapter 3 sec 3.1 Introduction and characterization of Eulerian graphs Conditions for Hamiltonian graphs Vertex and edge colouring to graphs Vertex and edge colouring to graphs Perfect graphs Students will learn to about Eulerian graphs Understanding the sufficient for hamiltonian graphs Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Lecture 23

T-1:Chapter 3 sec 3.2

Lecture 24

T-1:Chapter 14 Chapter 17 T-1:Chapter 14 Chapter 17 T-1:Chapter 14 sec 14.4 T-1:Chapter 14 sec 14.4

Understanding to color Peer Learning , the edge and graphs Discussion,Slides Understanding to color Peer Learning , the edge and graphs Discussion,Slides Student comes to know Peer Learning , about the perfect graph Discussion,Slides Student comes to know Peer Learning , about the perfect graph Discussion,Slides Student comes to know Peer Learning , about the planar Discussion,Slides graphs,Topic to be covered in lecture 26 and Test to be scheduled in lecture 27 Understanding of Euler Peer Learning , s theorem Discussion,Slides Students comes to know about the kuratowskis theorem Students comes to know about the kuratowskis theorem Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Week 9

Lecture 25

Perfect graphs

Lecture 27

Colouring and planar graphs(planar R-3:Chapter 8 sec graphs) 8.1 8.2

Planar graphs, Lecture 27 condsidered as contingency lecture

Week 10

Lecture 28 Lecture 29 Colouring and planar graphs (Euler's theorem) Colouring and planar graphs (Kuratowski's theorem) Colouring and planar graphs (Kuratowski's theorem) Colouring and planar graphs (Colouring of planar graphs) Colouring and planar graphs (Colouring of planar graphs) R-3:Chapter 8 sec 8.1 R-3:Chapter 8 sec 8.1 R-3:Chapter 9 sec 9.3 R-3:Chapter 9 sec 9.3 RW-1 RW-8

Quiz,Test 3 Eulers Theorem

Lecture 30

Kuratowskis Theorem

Week 11

Lecture 31

Kuratowskis Theorem

Lecture 32

Colouring of planar graphs Colouring of planar graphs

Understanding of planar Peer Learning , graphs colouring Discussion,Slides Understanding of planar Peer Learning , graphs colouring Discussion,Slides

Lecture 33

Week 12

Lecture 34

Colouring and planar graphs (Crossing number and thickness.)

RW-9

Corssing number and thickness of graphs

Students comes to know about the crossing number and thickness Understanding of matching of graphs Understanding of factros

Peer Learning , Discussion,Slides

Lecture 35

Operations and Extremal Graph theory(Matching) Operations and Extremal Graph theory(factors) Operations and Extremal Graph theory(decomposition and domination)

R-3:Chapter 7 sec 7.1 7.2 R-3:Chapter 7 sec 7.1 7.2 RW-10

Matching

Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Factors

decomposition and domination,Topic to be covered in lecture 35 and Test to be scheduled in lecture 36 Quiz,Test 1

Understanding Peer Learning , decomposition and Discussion,Slides domination,Topic to be covered in lecture 35 and Test to be scheduled in lecture 36 To be able to work on Turans theorem To be able to work on Ramsays theorem To be able to work on Szemeredis regularity lemma To be able to work on Szemeredis regularity lemma To be able to work on application in graph theory To be able to work on application in graph theory To be able to work on application in graph theory Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides Peer Learning , Discussion,Slides

Lecture 36 Week 13 Lecture 37 Operations and Extremal Graph theory(Turan's theorem) Operations and Extremal Graph theory(Ramsay's theorem) Operations and Extremal Graph theory(Szemeredi's regularity lemma) Operations and Extremal Graph theory(Szemeredi's regularity lemma) Operations and Extremal Graph theory(applications.) Lecture 41 Operations and Extremal Graph theory(applications.) Operations and Extremal Graph theory(applications.) T-1:Chapter 12 sec 12.1 12.2 T-1:Chapter 12 sec 12.3 T-1:Chapter 12 sec 12.4 T-1:Chapter 12 sec 12.4 T-1:Chapter 12 sec 12.4 T-1:Chapter 12 sec 12.4 T-1:Chapter 12 sec 12.4

Turans theorem

Lecture 38

Ramsays theorem

Lecture 39

Szemeredis regularity lemma Szemeredis regularity lemma Application in graph theory Application in graph theory Application in graph theory

Week 14

Lecture 40

Lecture 42

SPILL OVER
Week 15 Lecture 43 Lecture 44 Lecture 45 Spill Over Spill Over Spill Over

Scheme for CA:

Component Quiz,Test

Frequency 2

Out Of 3 Total :-

Each Marks Total Marks 10 10 20 20

Details of Academic Task(s)

AT No. Objective Topic of the Academic Task Nature of Academic Task (group/individuals/field work Evaluation Mode Allottment / submission Week 12 / 12

Quiz 1

To engage the student in in depth knowledge of the course.

In a quiz (MCQ based Test) the questions must be so framed that Individual student is not able to answer through sheer guess work. Each question must require some sought of analysis. The time limit should be decided carefully according to the complexity of questions and number of questions per test. Typically the maximum time available for MCQ based test should be one minute per question. Negative marking (25%) should be done to avoid guess work The test should consist of Analytical as well as descriptive questions. The test should consist of analytical and descriptive questions Individual

Performance in Quiz

Test 1

To test students knowledge and ability. To test students knowledge and ability.

Based on performance in test Based on performance in test

5/5

Test 2

Individual

9/9