The following graph with five vertices is a complete graph.
How many edges must be removed so that the graph will have the minimum number of edges to remain connected. Explain your answer. (3 marks)
--- 5 WORK AREA LINES (style=lined) ---
Show Worked Solution
`text(The minimum number of edges for a connected graph with)`
`text{5 vertices is 4 (see one possible example below).}`
`:.\ text(Edges to be removed)\ = 10-4= 6`