Maybe this paper/preprint could be relevant for you: Babel, Baumann, Ludecke, Tinhhofer: STABCOL -- Graph isomorphism testing based on the Weisfeiler-Leman algorithm.

OK, thank you. Our graphs are directed strongly regular graphs.

I think we have such a construction without using colours. Are you aware of such result without colours? I couldn't find any reference neither in your paper, nor elsewhere.

I have checked homepages of Andries Brouwer, Patric Ostergard, Ted Spence, Ian Wanless and yours (Did I miss anybody?) but no such data been found.

Thank you very much. This knowledge is very helpful. btw. Is there known any available database of isomorphism classes of loops of order 7? From the LOOPS package of GAP I can get them systematically up to order 6. For higher orders it can generate a loop randomly, but not systematically.

@TheMaskedAvenger: the search is useless also in that case.

The question reposted from math.stackexchange.com/questions/979879/…