
Page 1 of 4
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- Each matrix below lists the vertices v_1, v_2, in order.
- G H R F S K Elena studies a meadow food web with six species:
- P Q R S T Priya watches a frog on the pond in the figure.
- A simple graph G on the vertices 1, 2, 3, 4, 5, listed in that order, has adjacency matrix A with A² =…
- Let G be a simple graph with adjacency matrix A, and let v_i and v_j be vertices of G.
- A graph is r-regular when every vertex has degree r.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Adjacency matrices and their powers: the lesson ›More Chapter 10 worksheets: Graphs
- 10.1Degree, the handshake lemma and complete graphs
- 10.2Walks, paths, cycles and connected graphs
- 10.3Graph isomorphism: when two drawings are the same graph
- 10.4Euler paths and circuits
- 10.5Hamiltonian paths and cycles
- 10.6Trees
- 10.7Planar graphs and Euler's formula
- 10.8Graph coloring
- 10.9Bipartite graphs
- 10.10Weighted and directed graphs
- 10.11Finding a shortest path
- 10.12Spanning trees and minimum spanning trees
- 10.13Adjacency matrices and their powers