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.
Morris, J., Spiga, P. (2015). ∧-TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION. JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 99(1), 85-107 [10.1017/S1446788714000664].
∧-TRANSITIVE DIGRAPHS PRESERVING A CARTESIAN DECOMPOSITION
SPIGA, PABLOUltimo
2015
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.