Introduction
The degree/diameter problem for arctransitive graphs can be stated as follows:
Given natural numbers d and k, find the largest possible number N^{at}(d,k) of vertices in an arctransitive graph of maximum degree d and diameter k.
There are no better upper bounds for N^{at}(d,k) than the very general Moore bounds M(d,k)=d((d1)^{k}2)(d2)^{1}.
Therefore, in attempting to settle the values of N^{at}(d,k), research activities in this problem follow the next two directions:
 Increasing the lower bounds for N^{at}(d,k) by constructing ever larger graphs.
 Lowering and/or setting upper bounds for N^{at}(d,k) by proving the nonexistence of arctransitive graphs whose order is close to the Moore bounds M(d,k).
Increasing the lower bounds for N^{at}(d,k)
With the exception of the graphs obtained by Conder, no study has been identified in this reserach area.
Below is the unfinished table of the largest known arctransitive graphs in the undirected degree diameter problem for arctransitive graphs of degree at most 3 ≤ d ≤ 20 and diameter 2 ≤ k ≤ 10. Work in progress.
Table of the orders of the largest known arctransitive graphs for the undirected degree diameter problem
Graphs in bold are known to be optimal. For each entry in the table we have the order of the graph and the largest
value of r for which the known graph has rarctransitive automorphism group. (In some cases, where more
than one graph exists, there can be two or more possibilities for this value of r.)
\ 
2 
3 
4 
5 
6 
7 
8 
9 
10

3










4










5










6










7










8










9










10










The following table is the key to the colors in the table presented above:
Color 
Details

* 
Graphs found by Marston Conder.

* 
Graphs found by Primoz Potocnik.

* 
Graphs found by Jicheng Ma and Primoz Potocnik independently.

* 
Graphs found by Jicheng Ma.

Lowering and/or setting upper bounds for N^{at}(d,k)
No study has been identified in this reserach area.
References
External links