Discrete Mathematics 2
Course title: Discrete Mathematics 2
Code: 3ФЕИТ08З004
Number of credits (ECTS): 6
Weekly number of classes: 3+2+0+0
Prerequisite for enrollment of the subject: Taken course: Discrete Mathematics 1
Course Goals (acquired competencies): After finishing this course, the student should adopt the basic concepts of combinatorics, number theory and classical graph theory. The student should develop an ability for analytic thinking, critical observations, and learning ability.
Total available number of classes: 180
Course Syllabus: Combinatorics, generating functions. Number theory. Basics of cryptography. Graphs. Graphs isomorphisms. Subgraphs and spanning subgraphs. Connectivity. Euler and Hamilton graphs. Tournaments. Plane graphs. Graph coloring. Discharging method. Matching. Spectral graph theory and application. Laplace specter. Google page rank. Transporting networks, cuts and flows. Ford–Fulkerson algorithm. Random graphs, Reny-Erdos model, Случ Watts–Strogatz model. Probability method. Large graphs and electrical networks.
Literature:
|
Required Literature |
||||
|
No. |
Author |
Title |
Publisher |
Year |
|
1 |
D.West |
Introduction to Graph theory |
Prentice Hall |
2001 |
|
2 |
A. Bondy, U.S.R. Murty |
Graph theory |
Springer |
2001 |
|
3 |
J.H. van Lint, M.S. Wilson |
A course in combinatorics |
Cambridge Univ. Press |
2001 |
|
Additional Literature |
||||
|
No. |
Author |
Title |
Publisher |
Year |
|
1 |
N. Biggs |
Algebraic graph theory |
Cambridge Univ. Press |
1996 |
