M

Mr. Dubey • 89.66K Points
Coach

Q. An isomorphism of graphs G and H is a bijection f the vertex sets of G and H. Such that any two vertices u and v of G are adjacent in G if and only if

  • (A) f(u) and f(v) are contained in g but not contained in h
  • (B) f(u) and f(v) are adjacent in h
  • (C) f(u * v) = f(u) + f(v)
  • (D) f(u) = f(u)2 + f(v2)
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. The cluster features of different subclusters are maintained in a tree called ___________.

Q. MODEM stands for .

Q. CAD stands for

Q. _________helps to integrate, maintain and view the contents of the data warehousing system.

Q. What is data encryption standard (DES)?

Q. Broadcasting delivers the content to ___________

Q. The wait operation of the semaphore basically works on the basic system call.

Q. Which of the following adders can add three or more numbers at a time ?

Q. Which of the following statements is not applicable for cable internet access?

Q. A kind of serial dot-matrix printer that forms characters with magnetically-charged ink sprayed dots is called

Question analytics