Question

Need help with this question plz!!

The graph on the right is a possible efficient Network to the graph on the left.
Question 4 options:


True. All Vertices are connected by the least amount of edges.


False. Vertex 1 and 2 are not connected.


False. Vertex 3 and 4 are not connected.


True. You can get to Vertex 1 from Vertex 4 by going through Vertex 3.

Answer 1

The answer is A

Explanation:

Answer 2

Let us consider the image on the left that is the image in which 1 and 2 , 3 and 4 are connected as image 1 and the other as image 2.

1. All Vertices are connected by the least amount of edges. True

2. Vertex 1 and 2 are not connected. This is false for image

1 and true for image 2

3. Vertex 3 and 4 are not connected. This is false for image

1 and true for image 2

4. You can get to Vertex 1 from Vertex 4 by going through Vertex 3. This is true for image 1