Constructing reflection-symmetric flexible realisations of graphs
Preprint
Abstract
We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with reflection-symmetric flexible realisations. This condition is based on a specific type of edge colouring, where edges are assigned one of three colours in a symmetric way. From some of these colourings we also construct concrete reflection-symmetric realisations with their corresponding symmetry preserving motion. We study also a specific class of reflection-symmetric realisations consisting of triangles and parallelograms.Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Mobility of geometric constraint systems with extrusion symmetryBeiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry, 2024
- Flexibility and rigidity of frameworks consisting of triangles and parallelogramsComputational Geometry, 2023
- Flexing infinite frameworks with applications to braced Penrose tilingsDiscrete Applied Mathematics, 2022
- Flexible Placements of Graphs with Rotational Symmetry2021
- Flexible Placements of Periodic Graphs in the PlaneDiscrete & Computational Geometry, 2021
- FlexRiLoG—A SageMath Package for Motions of Graphs2020
- Graphs with flexible labelings allowing injective realizationsDiscrete Mathematics, 2020
- Graphs with Flexible LabelingsDiscrete & Computational Geometry, 2018
- The Orbit Rigidity Matrix of a Symmetric FrameworkDiscrete & Computational Geometry, 2010
- Symmetric Versions of Laman’s TheoremDiscrete & Computational Geometry, 2009