13D081TG - Graph Theory and Applications in Electrical Engineering and Computing
Course specification | ||||
---|---|---|---|---|
Course title | Graph Theory and Applications in Electrical Engineering and Computing | |||
Acronym | 13D081TG | |||
Study programme | Electrical Engineering and Computing | |||
Module | Applied Mathematics | |||
Type of study | doctoral studies | |||
Lecturer (for classes) | ||||
Lecturer/Associate (for practice) | ||||
Lecturer/Associate (for OTC) | ||||
ESPB | 9.0 | Status | elective | |
Condition | Mathematical education at the undergraduate level. | |||
The goal | Acquiring knowledge of selected topics of graph theory necessary in research in modern discrete mathematics and its applications in computer science and electrical engineering. | |||
The outcome | Students will be able to use methods of graph theory in research and applications in discrete mathematics, computer science and electrical engineering. | |||
Contents | ||||
Contents of lectures | Introduction. Independent cycles and trees. Planarity. Coloring. Inner and outer stability. Eulerian and Hamiltonian graphs. Connectivity and transport networks. Matrices and spectra. Line graphs. Spectra of adjacency matrices. Applications in linear algebra. Groups and graphs.Applications of graph theory in electrical engineering and computer science. | |||
Contents of exercises | ||||
Literature | ||||
| ||||
Number of hours per week during the semester/trimester/year | ||||
Lectures | Exercises | OTC | Study and Research | Other classes |
6 | ||||
Methods of teaching | Lectures. | |||
Knowledge score (maximum points 100) | ||||
Pre obligations | Points | Final exam | Points | |
Activites during lectures | Test paper | 70 | ||
Practical lessons | Oral examination | |||
Projects | ||||
Colloquia | ||||
Seminars | 30 |