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/

jmaths

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

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

Skills

    1. (a) 5
    2. (b) 6
    1. (a) 24
    1. (a) 2
    2. (b) 1
    1. (a) 2
    2. (b) 1
    1. (a) A-B-C-D; A-B-E-D; A-E-B-D (3 paths)
    2. (b) B-A-E-D-B; B-C-D-E-B (2 cycles)

  6. Semi-Eulerian. Odd vertices P and R. Trail P-Q-R-P-T-S-R

In context

    1. (a) 26
    2. (b) 7
    1. (a) 2
    2. (b) 3

Stretch

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

  2. k = 7

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