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

Mr. Dubey • 89.33K 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)
Views: 276
Filed under category Discrete Mathematics

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Loading Comments....

Q. Thus a of course data gives the values of all attributes, such as title and department, of all courses at a particular point in time.

Q. Aadhaar uses which of the given to uniquely identify the resident?

Q. A modulator converts a _____ signal to a(n) _____ signal.

Q. Detail data in single fact table is otherwise known as__________.

Q. A planning problem P in BSSP is defined as a _____________

Q. In a the vertex set and the edge set are finite sets.

Q. From the following, which one is used in an accelerometer?

Q. Who invented the high level language C?

Q. During the last few years, many algorithms have been applied to deep neural networks to learn the best policy for playing Atari video gam

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

Discusssion

Related MCQs

Question analytics