Showing that Paley Graphs are Edge-Transitive

Math Overflow hi,

I would like to show that Paley graph are rank 3-graphs (i.e Vertex-Transitive, Edge-Transitive and Non-Edge-Transitive).

Showing that they are Vertex transitive is easy - every x |-> x+k is an automorphism in GF(q) and so, for example, the automorphism x|-> x+1 shows that they are vertex transitive.

I also know how to show that they are self-complimentary and thus if I can show on of edge-transitivity/non-edge transitivity I get the other.

Can anyone help with how to show that they are indeed edge-transitive (or non-edge-transitive)

Thanks!

flag	asked Jul 16 2011 at 15:37 Shaywei 53●4

Use multiplication in $GF(q)$. I'm voting to close because this isn't a research-level question. – Andreas Blass Jul 16 2011 at 16:11

Agree with @Andreas, and especially since the question is poorly worded. – Igor Rivin Jul 16 2011 at 22:34

Browse other questions tagged co.combinatorics graph-theory or ask your own question.

question feed