IB Maths AI 3.12 Flashcards

This page contains our IB Maths AI flashcards for 3.12. By reviewing each one of these flashcards, you will fully cover the content for IB Maths AI 'Adjacency matrices'.

All Topic 3 Sub-topics 3.1: Fundamentals Of Geometry 3.2: Introduction To Trigonometry 3.3: Applied Trigonometry 3.4: Circles 3.5: Perpendicular Bisectors 3.6: Voronoi Diagrams (HL)3.7: Unit circle (HL)3.8: Geometric transformations (HL)3.9: Vectors (HL)3.10: Vector lines (HL)3.11: Graph theory (HL)3.12: Adjacency matrices (HL)3.13: Algorithms & problems

Checking your access to review these flashcards...

Attempted: 0

To review: 0

Front

Define an adjacency matrix.

Loading progress...

Front

State the entries used in an adjacency matrix for a simple unweighted graph.

Loading progress...

Front

State why the adjacency matrix of an undirected graph is symmetric.

Loading progress...

Front

State why diagonal entries are $0$ in the given simple graph adjacency matrix.

Loading progress...

Front

Complete the definition: An adjacency matrix entry in row $i$ and column $j$ shows whether vertex $i$ is _____ to vertex $j$ .

Loading progress...

Great work!

You have no cards left to review

Next Up

You have completed the sub-topic 3.12 flashcards, covering "Adjacency matrices" for IB Maths AI - continue with related resources below or explore the full IB Maths AI course from the IBO.

Other Sub-topic 3.12 resources