A graph is said to be edge-transitive if its automorphism group acts transitively on its
edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite.
We present a complete classification of all connected edge-transitive graphs on less than or
equal to
vertices. We investigate biregular bipartite edge-transitive graphs and present
connections to combinatorial designs, and we show that the Cartesian products of
complements of complete graphs give an additional family of edge-transitive
graphs.
PDF Access Denied
We have not been able to recognize your IP address
98.84.18.52
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.