Do isomorphic graphs have same adjacency matrix upto some permutation of both rows and columns?

313 Views Asked by At

Suppose $2$ graphs are isomorphic,then if we write the adjacency matrix of the second graph by arranging the rows and column in similar way to corresponding arrangement of vertices of first graph,then the matrix should remain identical.In general,these two matrices should be equivalent upto congruence $A\rho B\iff A=P^tBP$ for some $P$ non-singular.Am I correct?

1

There are 1 best solutions below

2
On BEST ANSWER

Yes, the permutation is the one induced by the graph isomorphism on the vertices and vice versa. It's really a restatement of the graph isomorphism, $P$ is not-only non-singular but a permutation matrix, and use $P^{T} =P^{-1}$ for those.