I implemented a new algorithm for checking if a directed graph with edge labels is Cayley. It is sensitive to the edge labels, works only for directed graphs, but is a much simpler algorithm overall.
It is based on Didier Caucal's characterization https://arxiv.org/abs/1609.08272 which says that a graph is Cayley if and only if it is deterministic, strongly connected, simple, and vertex transitive. Regards, Amri. -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
