Search

Question 1 of 8

No calculator

Consider the following stem graph

Stem network. Vertices in listed order: [E | D | B | A | C]. Full edge list: D–E; A–D; B–A; C–A; E–A; B–D.EDBAC
(a)1 mark

How many edges does the stem graph have?

(b)1 mark

Are the two displayed graphs isomorphic? Select the statement with the correct reason

Candidate network. Vertices in listed order: [S | R | P | Q | T]. Full edge list: Q–T; T–P; P–Q; S–T; S–P.SRPQT