Graph Theory FAQs: 03. Isomorphism Using Adjacency Matrix

An isomorphism from a graph G to a graph H is a bijection from the vertex set of G to the vertex set of H such that adjacency and non-adjacency are preserved. However, finding such a mapping is also equivalent to find a permutation matrix P such that A = PBP^T where A and B are the adjacency matrices of G and H respectively. We demonstrate how this works with an example. -- Graph Theory FAQs - by Dr. Sarada Herke. Related videos: GT09 Graph Isomorphisms - https://youtu.be/yFpRpxOry-A GT07 Adjacency and Incidence Matrices - https://youtu.be/LUDNz2bIjWI FAQ Graph Automorphisms - https://youtu.be/X4_4Bqj6EdA For quick videos about Math tips and useful facts, check out my other channel "Spoonful of Maths" - http://youtube.com/spoonfulofmaths Video Production by: Giuseppe Geracitano (goo.gl/O8TURb)