ConceptTheory & Algos
Isomorphic graphs
Undirected graphs G and H are isomorphic if they are identical except for a permutation (rearrangement) of the nodes.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Graph permutation1Undirected graph1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.