COURSE UNIT TITLE

: ALGEBRAIC GRAPH THEORY

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
CSC 5028 ALGEBRAIC GRAPH THEORY ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ZEYNEP NIHAN BERBERLER

Offered to

Ph.D. in Computer Science (English)
Computer Science

Course Objective

To introduce graph theory, algebra, and algebraic graph theory concepts, graph theory problems based on algebra, and solution methods with applications to computer science. To give a knowledge of basic concepts of algebraic graph theory. To solve computer science problems and problems of different type of disciplines by using algebraic graph theory concepts. To design efficient algorithms by using graph theory concepts.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of algebraic graph theory.
2   Be able to solve problems of algebraic graph theory
3   Be able to solve computer science problems by using algebraic graph theory concepts.
4   Be able to design efficient algorithms by using algebraic graph theory concepts.
5   Be able to solve problems of different type of disciplines by using concepts of algebraic graph theory.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction, notation and definitions
2 Graphs and matrices
3 Eigenvalues of graphs
4 Eigenvalues of graphs
5 Spectrum of a graph
6 Spectrum of a graph
7 Graph laplacians
8 Graph laplacians
9 Midterm exam
10 Algorithmic aspects
11 Algorithmic aspects
12 Combinatorial properties
13 Combinatorial properties
14 Symmetry and regularity

Recomended or Required Reading

Biggs, N. Algebraic Graph Theory, Cambridge Universtiy Press, (1993).
West D.B., Introduction to Graph Theory, Prentice Hall, NJ (2001).

Planned Learning Activities and Teaching Methods

The course is given by the lecturer generally, some periods of the course will continue interactively.

Assessment Methods

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


*** 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)

zeynep.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 3 39
Preparations before/after weekly lectures 13 4 52
Preparation for midterm exam 1 50 50
Preparation for final exam 1 60 60
Final 1 2 2
Midterm 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.13554
LO.23554
LO.34455
LO.455
LO.5344