Graph and subgraph isomorphism

In this article, we will learn about graph and subgraph isomorphism and the algorithms to check for graph and subgraph isomorphism.

Table of contents:Graph isomorphismSubgraph isomorphismSubgraph isomorphism algorithmsApplications

Graph isomorphism:
Given two simple graphs G and H we can say G and H are isomorphic if there is a one to one correspondence between the vertices and the edges, this means G and H are equivalent in terms of structure.

Conditions for two graphs to be isomorphic:

...