Practice Flashcards
What is an adjacency matrix?
Track your progress — Sign up free to save your progress and get smart review reminders based on spaced repetition.
All Flashcards in Topic 3.15
Below are all 8 flashcards for this topic. Sign up free to track your progress and get personalized review schedules.
3.15.18 cards
What is an adjacency matrix?
A square matrix where rows and columns are the vertices (same order); entry (i,j) = the number of edges from vertex i to vertex j.
How can you tell an undirected adjacency matrix from a directed one?
An undirected graph gives a SYMMETRIC matrix (edges go both ways); a directed graph is usually not symmetric.
What does the (i,j) entry of Aⁿ tell you?
The number of walks of length n (n edges, repeats allowed) from vertex i to vertex j.
Does 'length of a walk' mean distance?
No — length = the number of EDGES used. Use the weighted/distance matrix for actual distance.
Where do you read 'closed walks' (return to start) in Aⁿ?
On the DIAGONAL — entry (i,i) of Aⁿ counts walks of length n that start and end at vertex i.
How do you build a distance (weighted) matrix?
Replace each 1 in the adjacency matrix with the weight (distance/cost/time) of that edge; keep 0 (or blank/∞) where there is no edge.
How do you count length-4 routes from X to Y on a GDC?
Enter A, compute A⁴, then read the entry in row X, column Y.
For an undirected graph, what does the (i,i) entry of A² equal?
The degree of vertex i (the number of edges meeting it) — 'out and straight back'.
Topic 3.15 study notes
Full notes & explanations for Adjacency matrices (HL only)
Math AI exam skills
Paper structures, command terms & tips
Want smart review reminders?
Sign up free to track your progress. Our spaced repetition algorithm will tell you exactly which cards to review and when.
Start Free