No calculator
Consider the following stem graph
How many edges does the stem graph have?
Decide whether the candidate graph is isomorphic to the stem graph, and choose the matching reason
Yes. A relabelling preserves every edge, loop and parallel connection
No. The vertices occur in a different order around the drawing