Question

Need Help!!!

The following graph is an efficient network?

Question 2 options:


True. This network uses the least amount of edges to connect all vertices.


False. This network has a cycle making it inefficient.


True. This network has a cycle making it efficient.


False. It doesn't have enough edges to connect all the vertices.

Answer 1

True. this network uses the least amount of edges to connect all vertices

Answer 2

The correct option is 2.

Explanation:

In the given figure, there are 5 vertices and 5 edges.

In an efficient network, if we have n vertices, then (n-1) edges are required to connect all vertices.

Let the vertices are A, B, C, D and E.

The edges BC, CD, and DB form a cycle. If we remove any edge from these edges, then we have enough edges to connect all the vertices.

Therefore the statement "Given graph is an efficient network" is false. This network has a cycle making it inefficient and option 2 is correct.