Course Information
SemesterCourse Unit CodeCourse Unit TitleL+PCreditNumber of ECTS Credits
5MATH307INTRODUCTION TO GRAPH TEHORY3+036

Course Details
Language of Instruction English
Level of Course Unit First Cycle
Department / Program MATHEMATICS
Mode of Delivery Face to Face
Type of Course Unit Elective
Objectives of the Course Graph theory plays an important role in modelling problems not only in Mathematics but also in areas such as Computer Engineering Bioinformatics, Electronics and so forth. The goal of this course is to introduce graphs and graphs techiniques to mathematics as well as students in other areas.
Course Content
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Research Assist.Dr. Tina BEŞERİ SEVİM
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources D. West “Introduction to Graph Theory” Pearson
R. Diestel “Graph Theory” Springer

Course Category

Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm exams 2 % 40
Quizzes 5 % 15
Homeworks 5 % 15
Other activities 0 % 0
Laboratory works 0 % 0
Projects 0 % 0
Final examination 1 % 30
Total
13
% 100

ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Weekly Course Time 41 1 41
Outside Activities About Course (Attendance, Presentation, Midterm exam,Final exam, Quiz etc.) 5 21 105
Exams and Exam Preparations 3 11 33
Total Work Load   Number of ECTS Credits 6 179

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 The ability to understand and apply mathematical techniques for solving problems.
2 To model and solve practical problems with the assistance of mathematical tools.
3 To be able to discuss discrete objects
4 The ability to demonstrate knowledge of basic mathematical theorems.
5 To be able to prove basic discrete mathematics theorems.
6 To analyze problems and devise appropriate modelling structures.
7 To identify some hard problems in computer science and discrete mathematics.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Graph definitions and models, representation of graphs and morphisms R. Diestel “Graph Theory” Springer
2 Paths, cycles, degree sequences, special graphs R. Diestel “Graph Theory” Springer
3 Bipartite graphs, trees and distance, spanning trees R. Diestel “Graph Theory” Springer
4 Directed graphs R. Diestel “Graph Theory” Springer
5 Matchings and factors R. Diestel “Graph Theory” Springer
6 Independent sets and cliques, covers and dominating sets R. Diestel “Graph Theory” Springer
7 Maximum bipartite matching R. Diestel “Graph Theory” Springer
8 Hall matching condition, min-max theorems R. Diestel “Graph Theory” Springer
9 Connectivity and cuts R. Diestel “Graph Theory” Springer
10 Menger’s theorem and k-connected graphs R. Diestel “Graph Theory” Springer
11 Colorings of graphs R. Diestel “Graph Theory” Springer
12 Upper bounds and Brooks’ theorem R. Diestel “Graph Theory” Springer
13 Planar graphs, embeddings and Euler’s formula R. Diestel “Graph Theory” Springer
14 Colorings of planar graphs R. Diestel “Graph Theory” Springer
15 Final 1st week R. Diestel “Graph Theory” Springer
16 Final 2nd week R. Diestel “Graph Theory” Springer
 


Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12 P13 P14
C1 4 4 1 4 4 4 2
C2 4 4 4 4 3 4 3 4 4 4 2
C3 4 4 4 2 4 4 3 4 2 3 4
C4 2 2 2 4 2 4 4 2 3
C5 4 2 2 4 3 3 1 4 4 4
C6 4 4 1 4 3 4 4 4
C7 4 3 3 3 4 2 2 2 4 4

Contribution: 0: Null 1:Slight 2:Moderate 3:Significant 4:Very Significant


https://obs.iyte.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=163206&lang=en