UPDF AI

On strongly sequenceable abelian groups

B. Alspach,Georgina Liversidge

2020 · DOI: 10.26493/2590-9770.1291.c54
The Art of Discrete and Applied Mathematics · 31 Citations

TLDR

A method based on posets is used to show that if the connection set for a Cayley digraph on an abelian group has cardinality at most nine, then the digraph admits either an orthogonal directed path or an orthogsonal directed cycle.

Abstract

A group is strongly sequenceable if every connected Cayley digraph on the group admits an orthogonal directed cycle or an orthogonal directed path. This paper deals with the problem of whether finite abelian groups are strongly sequenceable. A method based on posets is used to show that if the connection set for a Cayley digraph on an abelian group has cardinality at most nine, then the digraph admits either an orthogonal directed path or an orthogonal directed cycle.