12 papers
Polyhedral Maps of Cubic Graphs with given Automorphism Groups
Ugo Detaille, Meike WeiÃ, Reymond Akpanya +1
L. Babai introduced a method for constructing a cubic graph whose automorphism group is isomorphic to a given finite group , obtained by modifying a corresponding Cayley graph o…
An algorithmic approach for computing fundamental domains of crystallographic groups
Reymond Akpanya, Alice C. Niemeyer, Lukas Schnelle
A crystallographic group is a discrete subgroup of the Euclidean group that has a compact fundamental domain. Since such a crystallographic group is infi…
Strong Embeddings of Regular Graphs with Prescribed Automorphism Groups
Reymond Akpanya, Tom Goertzen, Meike WeiÃ
A classical theorem of Frucht states that every finite group occurs as the automorphism group of a finite graph. We prove an embedded analogue for regular graphs of arbitrary degre…
Influence of the geometry on the mechanical performance of tubular interlockings: A study of the Sine Block
Domen Macek, Meike WeiÃ, Reymond Akpanya +3
Topological interlocking assemblies (TIA) are arrangements of blocks such that rigid-body motions of the blocks are fully constrained by their neighbours and a fixed frame. In this…
On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
Meike WeiÃ, Reymond Akpanya, Alice C. Niemeyer
A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit do…
Influence of a generative parameter on the mechanical performance of topological interlocking assemblies of a hexagonal block
Lukas Schnelle, Meike WeiÃ, Reymond Akpanya +2
A topological interlocking assembly is an arrangement of blocks, where all blocks are kinematically constrained by their neighboring blocks and a fixed frame. This concept has been…