$\wedge$-transitive digraphs preserving a cartesian decomposition
Combinatorics
2014-07-02 v2
Abstract
In this paper, we combine group-theoretic and combinatorial techniques to study -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.
Cite
@article{arxiv.1203.6386,
title = {$\wedge$-transitive digraphs preserving a cartesian decomposition},
author = {Joy Morris and Pablo Spiga},
journal= {arXiv preprint arXiv:1203.6386},
year = {2014}
}
Comments
Revised version, most significant changes to title and introduction