Question: Question 4 (20 marks) Consider the following weighted graph: (a) Write down the adjacency and weight matrices for this graph. 4 marks (b) Compute and
Question 4 (20 marks) Consider the following weighted graph: (a) Write down the adjacency and weight matrices for this graph. 4 marks (b) Compute and sketch the minimal spanning tree for the graph. 4 marks (c) Is the graph Eulerian, semi-Eulerian or neither? Explain the reasons behind your answer. 4 marks (d) If the graph is Eulerian or semi-Eulerian, find an Eulerian circuit or path. If Semi-Eulerian modify the graph, to create a Eulerian circuit. 4 marks (e) What happens to the minimum spanning tree of this graph if another edge is added to the tree? Justify your answer. 2 marks (f) How many edges does a tree with 9 245 vertices have? 2 mark

Consider the following weighted graph: 15 14 12 7 4 VA V5 V6 V10 2 19 3 14 V3 V11 9 18 20 V 2 V1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
