$\wedge$-transitive digraphs preserving a cartesian decomposition

In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be of considerable interest.

No reviews yet.

No comments yet.