$\wedge$-transitive digraphs preserving a cartesian decomposition

TL;DR

This paper investigates $ abla$-transitive digraphs with a cartesian decomposition, combining group theory and combinatorics to discover a new family of such digraphs with potential significance.

Contribution

It introduces a novel family of $ abla$-transitive digraphs that admit a cartesian decomposition, using a combined group-theoretic and combinatorial approach.

Findings

Discovery of a new family of $ abla$-transitive digraphs

Application of combined group-theoretic and combinatorial techniques

Potential significance of the new digraph family in the field

Abstract

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.