A permutation p of the vertex set of a graph G with the property that {a,b} is an edge if and only if {p(a), p(b)} is an dege, is called an automorphism of G. Is this right? this sounds isomorphism to me.(adsbygoogle = window.adsbygoogle || []).push({});

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Automorphism I don't understand

**Physics Forums | Science Articles, Homework Help, Discussion**