Sign in to jmaths to print this page or save it as a PDF: jmaths-8ce638778fd6.herokuapp.com/maths/ai-hl/graph-theory/ahl-1-4/problems/b/

jmaths

IB Mathematics: Applications and Interpretation HL · AHL 1: Graph Theory · AHL 1.4

Counting walks with powers of the adjacency matrix Problem set B Answers

Skills

    1. (a) 9
    2. (b) 19
    1. (a) 31
    1. (a) 2
    2. (b) 1
    1. (a) 3
    2. (b) 2
    1. (a) M-N-P-Q; M-N-R-Q; M-R-N-Q (3 paths)
    2. (b) N-M-R-Q-N; N-P-Q-R-N (2 cycles)

  6. Semi-Eulerian. Odd vertices V and X. Trail V-U-Y-X-V-W-X

In context

    1. (a) 9
    2. (b) 4
    1. (a) 3
    2. (b) 2

Stretch

    1. (a) Diagonal 2, 3, 3, 2, 4: it equals the degrees 2, 3, 3, 2, 4
    2. (b) 7 edges

  2. k = 8

jmaths.xyz · AI HL · AHL 1.4 Counting walks with powers of the adjacency matrix