10 citations · 10 across the 10 of their papers we have counts for
5 papers · 1 filter
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…
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…
Construction Methods for Space-Filling Heterogeneous Topological Interlocking Assemblies
Meike Weiß, Alice C. Niemeyer
Deforming fundamental domains of wallpaper groups provides a systematic way to generate non-convex blocks which admit topological interlocking assemblies (TIAs). We use this approa…
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…