Discrete Mathematics MCQ: 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 | Extra Education

← All Discrete Mathematics questions

1

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

Correct Answer: f(u) and f(v) are adjacent in h

Make the most of this question

This page focuses on one Discrete Mathematics question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

← More Discrete Mathematics MCQs All Engineering topics Mock test hub

WhatsApp+91 99922 70404Discrete Mathematics MCQ: 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 | Extra Education