
Page 1 of 3
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
- An archipelago has 9 islands, numbered 1 to 9.
- The house graph H has vertices p, q, r, s, t and edges pq, qr, rs, sp, tp, tq:
- A classmate lists five graphs, each with vertex set \1, 2, 3, 4, 5\ and exactly 4 edges, and claims that every graph on 5 vertices with 4 edges is…
- A B C D E F G H S A B C D E F G H T A panel has three switches, each up (1) or down (0), so it has 8 states, written as strings such as 010.
- Let G and H be isomorphic graphs, and let h be one isomorphism from G to H.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Graph isomorphism: when two drawings are the same graph: 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