wedge-transitive digraphs preserving a cartesian decomposition
classification
🧮 math.CO
keywords
digraphscartesiandecompositiontransitivewedgeadmittingapproachcombinatorial
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.