Question:medium

Two graphs $G_1$ and $G_2$ are isomorphic if which of the following conditions is satisfied?

Show Hint

Think of isomorphism as "renaming" vertices. If you can rename the vertices of graph A to match the labels of graph B such that the edge list becomes identical, the graphs are isomorphic.
Updated On: Jul 4, 2026
  • Both graphs have the same number of vertices only
  • Both graphs have the same number of edges only
  • There exists a one-to-one correspondence between their vertices that preserves adjacency
  • Both graphs have the same number of vertices but different edges
Show Solution

The Correct Option is C

Solution and Explanation

Was this answer helpful?
0

Top Questions on Combinatorics

Questions Asked in AP PGECET exam