A

Admin • 802.91K Points
Coach

Q. A graph is said to be complete if there is an edge between every pair of vertices.

  • (A) true, true
  • (B) false, true
  • (C) false, false
  • (D) true, false

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.