Digraphs
Digraphs copied to clipboard
Implement `Is2EdgeTransitive`
I think this might be a nice thing to have. Here's a definition from https://www.sciencedirect.com/science/article/pii/S0095895615001203:
A 2-arc of a graph is a triple (u,v,w) of pairwise distinct vertices such that v is adjacent to both u and w. We say that a graph is 2-arc-transitive if its automorphism group acts transitively on its 2-arcs.
We should probably first check that this is the standard definition, and also make sure that the notion makes sense for arbitrary digraphs.
Is anyone working on this now? We might reassign it to our new VIP students.
Solved in #733, #736, #739.