z-logo
open-access-imgOpen Access
Circulant Homogeneous Factorisations of Complete Digraphs $\rm\bf K_{p^d}$ with $p$ an Odd Prime
Author(s) -
Jing Xu
Publication year - 2017
Publication title -
˜the œelectronic journal of combinatorics/˜the œjournal of combinatorics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.703
H-Index - 52
eISSN - 1097-1440
pISSN - 1077-8926
DOI - 10.37236/6477
Subject(s) - combinatorics , circulant matrix , mathematics , factorization , partition (number theory) , prime (order theory) , homogeneous , lexicographical order , prime power , discrete mathematics , algorithm
Let $\mathcal F=(\rm\bf K_{n},\mathcal P)$ be a circulant homogeneous factorisation of index $k$, that means $\mathcal P$ is a partition of the arc set of the complete digraph $\rm\bf K_n$ into $k$ circulant factor digraphs such that there exists $\sigma\in S_n$ permuting the factor circulants transitively amongst themselves. Suppose further such an element $\sigma$ normalises the cyclic regular automorphism group of these circulant factor digraphs, we say $\mathcal F$ is normal. Let $\mathcal F=(\rm\bf K_{p^d},\mathcal P)$ be a circulant homogeneous factorisation of index $k$ where $p^d$,  ($d\ge 1$) is an odd prime power. It is shown in this paper that either $\mathcal F$ is normal or $\mathcal F$ is a lexicographic product of two smaller circulant homogeneous factorisations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here