M

Mr. Dubey • 97.30K 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 IA-32 processor can switch between 16 bit operation and 32 bit operation with the help of instruction prefix bit.

Q. Who formulated Chan’s algorithm?

Q. Applications that work with cloud computing that have low margins and usually low risk are

Q. Which of the following are not the components of the HCI approach to design?

Q. A property________________.

Q. -----------is theapplication of quality principles to all facets and business process of an organization.

Q. What is start frame delimeter (SFD) in ethernet frame?

Q. The device which changes from serial data to parallel data is

Q. The average number of key comparisons done in a successful sequential search in a list of length n is ____________.

Q. A command to remove a relation from an SQL database

Question analytics