
Page 1 of 5
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
- Samir is wiring the seven docks K, L, M, N, P, R, S of a marina for shore power, with just enough cable for power to pass between every two docks.
- The graph G in the figure has nine vertices a to i.
- Elena's electric co-op will run power lines from its substation H to four farms A, B, C, D.
- Decide whether each statement is true for every connected weighted graph G.
- Let G be a connected weighted graph with n vertices.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Spanning trees and minimum spanning trees: 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