M

Mr. Dubey • 100.69K Points
Coach

Q. The total number of edges in a complete graph of n vertices is _________.

  • (A) n
  • (B) n/2
  • (C) [n(n-a)]/3
  • (D) [n(n-a)]/2
Share

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.

Related MCQs

Q. OpenGL stands for:

Q. How do developing organizations influence by architects?

Q. To distinguish between two sectors we make use of

Q. The problem of finding hidden structure in unlabeled data is called…

Q. One output structure of a TTL gate is often referred to as a

Q. Which of the following is a function of top level management?

Q. The permission -rwxr–r– represented in octal expression will be

Q. DIP stand for:

Q. The parallel execution of operations in VLIW is done according to the schedule determined by .....

Q. Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked li

Question analytics