On strongly sequenceable abelian groups

Keywords: Strongly sequenceable, abelian group, diffuse poset, sequenceable poset

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.

Published
2020-02-19
Section
International Workshop on Symmetries of Graph and Networks 2018