Solution to Explain graph isomorphism with proper diagrams. - Sikademy
Author Image

Archangel Macsika

Explain graph isomorphism with proper diagrams.

The Answer to the Question
is below this banner.

Can't find a solution anywhere?

NEED A FAST ANSWER TO ANY QUESTION OR ASSIGNMENT?

Get the Answers Now!

You will get a detailed answer to your question or assignment in the shortest time possible.

Here's the Solution to this Question

An isomorphism exists between two graphs G and H if:

1. Number of vertices of G = Number of vertices of H.

2. Number of edges of G = Number of edges of H.

Please note that the above two points do not guarantee isomorphism.

In addition, if f is a function obtained from a relationship between the vertices of G and the vertices of H, then f should be a one to one and onto function (bijection) and the number of vertices with same degree, must be same in G and H. A degree is the number of edges connected to a vertex.


Related Answers

Was this answer helpful?

Join our Community to stay in the know

Get updates for similar and other helpful Answers

Question ID: mtid-5-stid-8-sqid-3658-qpid-2357