Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

We know that two graphs are isomorphic iff their adjacency matrices are similar via a permutation matrix. But if the adjacency matrices are similar, does it imply the graphs are isomorphic?

This question Any proof or counterexamples are welcomed, thank you!

share|improve this question
4  
    
@QiaochuYuan Thanks!But I wonder how to prove that the same multiset of eigenvalues in adjacency matrices implies similarity. –  Golbez Feb 24 '13 at 1:59
1  
If your graphs are undirected, this follows by the spectral theorem (which implies that adjacency matrices are diagonalizable). –  Qiaochu Yuan Feb 24 '13 at 6:59
    
@QiaochuYuan Got it! You can make it an answer so that I can select as the best answer. –  Golbez Feb 24 '13 at 9:30
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.