Question

For graphs \(G_0\) and \(G_1\) show that \(G_0\) is isomorphic to \(G_1\) if and only if there exists permutation matrix \(P\) such that \(P^{T}A_{G_0}P = A_{G_1}\) where \(A_{G_0}\) and \(A_{G_1}\) are the adjacency matricies for \(G_0\) and \(G_1\) respectively.

Answer 1

@geerky42 I cant msg you back... you are not a fan of me

Answer 2

But yes I have had way harder things answered on this site, and this is actually linear algebra which many people here love. The question is posted on math stack exchange as well but the answer is not rigorous and they don't like when you repost questions even if the other thread is dead...