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

Home / Engineering / Discrete Mathematics / Question

Mr. Dubey • 51.32K 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

(D) f(u) = f(u)2 + f(v2)

Correct answer : Option (B) - f(u) and f(v) are adjacent in h

Discusssion

Related MCQs on Discrete Mathematics

Q. Who invented the high level language C?

Q. What does MBR stand for?

Q. A collection of nodes capable of environmental sensing, local computation, and communication with its peers or with other higher performance nodes

Q. Study of creating a d using encryption and decryption techniques.

Q. True or False: Ensemble learning can only be applied to supervised learning methods.

Q. The bandwidth(A) in a fuzzy set is given by

Q. Which of the following is true about top- down design process?

Q. Effective Interest Rate is Actual interest earned or paid in a year or some other time period

Q. If there are multiple recycle bin for a hard disk

Q. The effectiveness of the cache memory is based on the property of ________