A community for students.

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

zzr0ck3r

  • one year ago

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.

  • This Question is Closed
  1. zzr0ck3r
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

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

  2. zzr0ck3r
    • one year ago
    Best Response
    You've already chosen the best response.
    Medals 0

    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...

  3. Not the answer you are looking for?
    Search for more explanations.

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.