Search

Question 1 of 8

No calculator

Consider the undirected graph below

Graph; every repeated endpoint pair in the full list denotes separate parallel edges. Vertices in listed order: [E | A | F | B | D]. Full edge list: D–F; A–E; B–E; B–A.EAFBD
(a)1 mark

How many vertices does the graph have?

(b)1 mark

How many edges does the graph have?