Relative Heffter arrays and biembeddings
DOI:
https://doi.org/10.26493/1855-3974.2110.6f2Keywords:
Heffter array, biembedding, multipartite complete graphAbstract
Relative Heffter arrays, denoted by Ht(m, n; s, k), have been introduced as a generalization of the classical concept of Heffter array. A Ht(m, n; s, k) is an m × n partially filled array with elements in ℤv, where v = 2nk + t, whose rows contain s filled cells and whose columns contain k filled cells, such that the elements in every row and column sum to zero and, for every x ∈ ℤv not belonging to the subgroup of order t, either x or −x appears in the array. In this paper we show how relative Heffter arrays can be used to construct biembeddings of cyclic cycle decompositions of the complete multipartite graph K(2nk + t)/t × t into an orientable surface. In particular, we construct such biembeddings providing integer globally simple square relative Heffter arrays for t = k = 3, 5, 7, 9 and n ≡ 3 (mod 4) and for k = 3 with t = n, 2n, any odd n.
Downloads
Additional Files
Published
Issue
Section
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/