COURSE UNIT TITLE

: EXTRAMAL PROBLEMS AND SPECIAL GRAPHS

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSC 5044 EXTRAMAL PROBLEMS AND SPECIAL GRAPHS ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Third Cycle Programmes (Doctorate Degree)

Course Coordinator

ASSOCIATE PROFESSOR FIDAN NURIYEVA

Offered to

Computer Science
Ph.D. in Computer Science

Course Objective

The aim of this course is to introduce to students the extremal problems and special graphs.

Learning Outcomes of the Course Unit

1   Be able to learn extremal problems
2   Be able to learn the special types of graphs
3   Be able to generate new graph types by using graph operations and to analyze some of their properties

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 The definition of extramal problems
2 Theorem of Turan
3 Cages
4 Ramsey Theory
5 Ramsey Theory
6 Counting Problems
7 Perfect Graphs, Split Graphs and Permutation Graphs
8 Midterm exam
9 Graph Labeling and Magic Graphs
10 Conservative Graphs
11 Problem Solving
12 Graph Coloring and Matchings
13 Planar Graphs and Four Color Problems
14 Project presentations.

Recomended or Required Reading

Textbook(s):
1. Hartsfield, N. & Ringel, G. ; Pearls in Graph Theory, 1990, Academic Press
Supplementary Book(s):
1. Chartrand, G., Lesniak L., 1996. Graphs and Digraphs .Wadsworth Inc., ISBN : 0534063241
2. Buckley, F., Harary F., 1990. Distance in Graphs . Perseus Books, ISBN: 0201095912
3. Bondy, J. A., 1976. Graph Theory with Applications . Elsevier Science Ltd, ISBN: 0444194517

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 ASG ASSIGNMENT
2 MTE MIDTERM EXAM
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE ASG * 0.30 + MTE * 0.30 + FIN * 0.40
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) ASG * 0.30 + MTE * 0.30 + RST * 0.40


*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

fidan.nuriyeva@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparations before/after weekly lectures 14 3 42
Preparation for midterm exam 1 40 40
Preparation for final exam 1 40 40
Preparing assignments 1 35 35
Preparing presentations 0 0 0
Final 1 2 2
Midterm 1 2 2
Project Assignment 1 2 2
TOTAL WORKLOAD (hours) 205

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.15555
LO.25555
LO.35555

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS