Lemma
EasyGraph theory
OpenStax, Contemporary Mathematics §12.3 Comparing Graphs · Example 1 · Combinatorics · Graph theory

Comparing Graphs · Example 1

A teacher uses games to teach her students about colors and numbers as shown in the figure.
In the Colors Game, shown in Figure A, each player begins in the space marked START and proceeds in a counterclockwise direction. On each turn, the player spins a spinner marked 1 and 2 and moves forward the number of spaces shown on the spinner. If the player lands on a space marked with any color other than white, the player must move forward or back to the other space of the same color. The first player to land in or pass the space marked END wins.
In the Clock Game, shown in Figure B, each player begins in the space marked START and proceeds in a clockwise direction. On each turn, the player spins a spinner marked 1 and 2 and moves forward the number of spaces shown on the spinner. In the same turn, the player must read the number in the space and move forward the number of spaces indicated by a positive value or backward the number of spaces indicated by a negative value. Then the turn ends. The first player to land in or pass the space marked END wins.
Draw a graph or multigraph to represent each game in which the vertices are the spaces and the edges represent the ability of a player to move between the spaces either by a spin or as dictated by a marked color or number. (We will ignore the direction of motion for simplicity.) Transform one of the graphs to show that it is isomorphic to the other and explain what this tells you about the games.

This problem refers to a figure in its source book that isn't reproduced here.

~5 minWritten answer · compare with the solution

OpenStax, Contemporary Mathematics · §12.3 Comparing Graphs · Example 1

Stuck? A gentle nudge

No hints for this one.

Something off?
Workspace
Your working

Check your full solution

Upload photos of your handwritten work or a PDF, and Lemma will read it and tell you whether it's right — and where it first goes wrong if not.