Display language
To modulepage Generate PDF

#40986 / #1

Seit SoSe 2020

English

Algebraic Graph Theory

6

Kreutzer, Stephan

benotet

Mündliche Prüfung

Zugehörigkeit


Fakultät IV

Institut für Softwaretechnik und Theoretische Informatik

34352200 FG Logik und Semantik

No information

Kontakt


TEL 7-3

Pilz, Jana

stephan.kreutzer@tu-berlin.de

No information

Learning Outcomes

After successfully completing this course, the students are able to: - name the important theorems and their essence addressed during the lecture. - understand the results stated during the lecture. More precisely this means: o the can qualitatively sketch the proofs of the main results and explain them, also via pictures. o they can give full proofs of smaller results occurring in the lecture. o they understand why and where certain assumptions were made and used, respectively. - compare different (graph theoretic) invariants and prove their relationship, if it exists, as well as to give examples for such relations. - analyse graph theoretic theorems and their proofs under the aspect whether they are (might be) a matroidal result. - analyse graphs under algebraic aspects and use / apply algebraic techniques and invariants to obtain structural results about graphs. - name the current research status regarding open problems that were addressed during the lecture.

Content

Basics in Matroid Theory Connections between graphs and matroid via cut/cycle space of graphs Planar duality and their matroidal aspects Group actions on graphs Transitive graphs Cayley graphs Spectral Graph Theory.

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Algebraic Graph TheoryUE3435 L 10587SoSeEnglish2
Algebraic Graph TheoryVL3435 L 10590SoSeEnglish2

Workload and Credit Points

Algebraic Graph Theory (UE):

Workload descriptionMultiplierHoursTotal
Attendance15.02.0h30.0h
Pre/post processing15.04.0h60.0h
90.0h(~3 LP)

Algebraic Graph Theory (VL):

Workload descriptionMultiplierHoursTotal
Attendance15.02.0h30.0h
Pre/post processing15.04.0h60.0h
90.0h(~3 LP)
The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

Description of Teaching and Learning Methods

- Lecture presenting the core material - tutorials in which examples and exercises are discussed

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Students should have basic knowledge of graph theory. In addition, basic knowledge of Linear Algebra and Group Theory may be helpful but is not a requirement.

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

30-40 minutes

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Sommersemester.

Maximum Number of Participants

This module is not limited to a number of students.

Registration Procedures

Qispos

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable

 

Electronical lecture notes

Availability:  available

 

Literature

Recommended literature
Algebraic Graph Theory by C. Godsil and G. Royle
Graph Theory by Reinhard Diestel, Springer-Verlag

Assigned Degree Programs

This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Master and bachelor students of Mathematics and Computer Science.

Miscellaneous

No information