M

Mr. Dubey • 53.56K Points
Coach 

Q. If the graph G1 and G2 has no vertex in common then it is said to be ______.

(A) disjoint
(B) edge disjoint
(C) union
(D) intersection
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.

Be the first to start discuss.

Related MCQs

Q. Process improvement is the set of activities, methods, and transformations that developers use to develop and maintain information systems.

Q. The SDRAM performs operation on the

Q. Directories are …….

Q. In Distributed arbitration, the device requesting the BUS

Q. Components used for generation of turbo codes are

Q. Inference rules maintain

Q. Entries known as mapping.

Q. Web Crawler is a/an

Q. Bottom-up integration testing has as it's major advantage(s) that

Q. ______ is a unique tag, usually a number identifies the file within the file system.

Question analytics