How can we find the proof of the following statement:
An undirected graph is edge transitive if and only if its line graph is vertex transitive.



Vertex transitive and edge transitive and line graph
G. Sabidussi, Math. Zeitschr. 76, 385-401 (1961) proved that the automorphism group of a (simple) connected graph is isomorphic to the automorphism group of its linegraph, with the obvious isomorphism, unless the graph is one of four exceptions: the complete graphs $K\_2$ and $K\_4$, a triangle with an extra edge attached, and two triangles sharing an edge. Sabidussi also gave a new proof of a theorem earlier proved by Whitney, namely that the only two non-isomorphic connected graphs with isomorphic linegraphs are the triangle and the 3-star $K\_{1,3}$.


We also need to think about isolated vertices, since they vanish without trace in the line graph. But they aren't really a problem since they don't affect edge-transitivity.


Putting all this together, we find that the only exceptions to the claim "a graph is edge transitive if and only if its line graph is vertex transitive" are disconnected graphs whose components are all $K\_1$, $K\_3$ or $K\_{1,3}$, with at least one $K\_3$ and at least one $K\_{1,3}$.


