📖 Graph Isomorphism

Two graphs G and H are isomorphic (G \= H) if there exists a bijection f: V(G) \-> V(H) such that uv in E(G) if and only if f(u)f(v) in E(H).

From: Introduction to Graph Theory

Learn more: https://west-graphs-deploy.vercel.app/#/section/1

Explore all courses: https://mathacademy-cyan.vercel.app