COURSE UNIT TITLE

: GRAPH THEORY

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
MAT 4051 GRAPH THEORY ELECTIVE 4 0 0 7

Offered By

Mathematics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ASLI GÜÇLÜKAN ILHAN

Offered to

Mathematics (Evening)
Mathematics

Course Objective

This course aims to introduce graph theory to students. It discusses properties of graphs, basic algorithms of graph theory and their correctness proofs.

Learning Outcomes of the Course Unit

1   To define the basic notions of graph theory
2   To understand the properties of trees and bipartite graphs
3   To understand Euler, Hamilton and planar graphs
4   To implement graph theoretical algorithms

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Basic Concepts of Graph Theory
2 Special Graphs
3 Graph Realization Problem
4 Isomorphic Graphs, Classification of Bipartite Graphs
5 Trees&Forests
6 Prufer's Method
7 Prim's and the Reduction Algorithms
8 Dijakstra's Algorithm
9 Ford's Algorithm
10 Euler Paths/Cycles
11 Hamilton Paths and Some Negative Tests for Hamilton Paths
12 Some Positive Tests for Hamilton Paths
13 Planar Graphs
14 Kuratowski's Theorem

Recomended or Required Reading

Textbook:
1) Graph Theory: A problem oriented approach, Daniel A. Marcus, 2008, Mathematical Association of America, ISBN 0883857723.

Supplementary Book(s):
1. Introduction to Graph Theory, Robin J. Wilson, 5th edition, 2010, Pearson, ISBN: 97800273728894
2. Discrete and Combinatorial Mathematics, R. Grimaldi 5th ed. ISBN 9780201726343.
3. Discrete Mathematics and its applications, K. Rosen 6th ed. ISBN 9780073229720.

References:
1.Introduction to Graph Theory, Douglas B. West, 2nd ed. 2001, Pentice Hall. Pub. ISBN 0-13-014400-2.

Planned Learning Activities and Teaching Methods

Face to face and presentation

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 QUZ QUIZ
3 FIN FINAL EXAM
4 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + QUZ * 0.10 + FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + QUZ * 0.10 + RST * 0.50


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

Further Notes About Assessment Methods

None

Assessment Criteria

Students' learning outcomes will be evaluated through written exams consisting of 3 quizzes, a midterm exam and a final exam.

Language of Instruction

English

Course Policies and Rules

Students are required to have over 70% attendance in order to take the final exam.

Contact Details for the Lecturer(s)

e-mail: asli.ilhan@deu.edu.tr
Tel: +90 232 3018597

Office Hours

Monday: 14:40-16:30

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 4 56
Preparations before/after weekly lectures 14 3 42
Preparation for midterm exam 1 25 25
Preparation for final exam 1 35 35
Preparation for quiz etc. 3 5 15
Final 1 2 2
Midterm 1 2 2
Quiz etc. 3 1 3
TOTAL WORKLOAD (hours) 180

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.1544
LO.25434344
LO.35434344
LO.454434344