\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)

Graph Theory

Learning tasks
                
Lesson Summary
Text book
Exercises Correction
A) Definitions
    1) Determining the Degree of VerticesEx 1 Ex 2 Ex 3 Ex 4 Ex 5 Ex 6
    2) Identifying Paths and CircuitsEx 7 Ex 8 Ex 9 Ex 10
    3) Analyzing Paths in Weighted GraphsEx 11 Ex 12 Ex 13 Ex 14
    4) Modelling Situations with GraphsEx 15 Ex 16 Ex 17 Ex 18 Ex 19
    5) Classifying Sequences of VerticesEx 20 Ex 21 Ex 22 Ex 23
B) Properties of Graphs
    6) Identifying Graph PropertiesEx 24 Ex 25 Ex 26
C) Adjacency Matrices
    7) Writing Adjacency MatricesEx 27 Ex 28 Ex 29 Ex 30
    8) Determining the Number of WalksEx 31 Ex 32 Ex 33
D) Trees and Minimum Spanning Trees
    9) Identifying TreesEx 34 Ex 35
    10) Optimizing NetworksEx 36 Ex 37 Ex 38
    11) Determining the Minimum Spanning TreeEx 39 Ex 40 Ex 41
E) Eulerian Graphs
    12) Identifying Eulerian Circuits and TrailsEx 42 Ex 43 Ex 44
    13) Solving the Chinese Postman ProblemEx 45 Ex 46 Ex 47
F) Hamiltonian Graphs
    14) Identifying Hamiltonian Paths and CyclesEx 48 Ex 49 Ex 50
    15) Finding Optimal Tour BoundsEx 51 Ex 52 Ex 53 Ex 54