How do I go about checking if the graph with the given paramaters is a Cayley graph?



Regular graph of order 50, degree 7 and Automorphism group of order 288000. How to check if it is Cayley
A graph is Cayley if and only if its automorphism group has a regular subgroup. A computer algebra system such as Magma or GAP (I think) usually can determine if a permutation group of order 288000 has a regular subgroup rather quickly.


If you can give the graph or the automorphism group in some common format, somebody might even run the computation for you.


