Course: Discrete mathematics
Code: 3ФЕИТ08004
ECTS points: 6 ECTS
Number of classes per week: 3+0+0+3
Lecturer: Assoc. Prof. Dr. Vesna Andova
Course Goals (acquired competencies): After finishing this course, the students should deal with the basic concepts of combinatorics and classical graph theory. The student s should develop an ability for analytic thinking and critical observations. They should also improve the ability for learning.
Course Syllabus: Basic concepts of combinatorics. Subsets, partitions and permutations. Permutation groups and cyclic indices. Mobius transformation and inverse formula. Linear recursions and generating functions. Introduction to graph theory. Graph representation. connectivity, coverings and packing. Weighted graphs. Minimal spanning tree. Planarity. Graph coloring. Shortest path. Extreme graph theory. graph spectra. Graph algorithms.
Literature:
|
Required Literature |
||||
|
No. |
Author |
Title |
Publisher |
Year |
|
1 |
A. Bondy, U.S.R. Murty | Graph Theory | Springer | 2008 |
|
2 |
J.H.van Lint, M.S. Wilson | A course in combinatorics | Cambridge Univ. Press | 2001 |
|
3 |
P.J.Cameron | Notes on counting | University of London | 2003 |
