Sufficient connectivity conditions for rigidity of symmetric frameworks
From MaRDI portal
(Redirected from Publication:2111186)
Abstract: It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both `forced symmetric' and `incidentally symmetric' infinitesimal rigidity in the plane.
Recommendations
- A sufficient connectivity condition for generic rigidity in the plane
- Generic rigidity with forced symmetry and sparse colored graphs
- Frameworks with forced symmetry. I: Reflections and rotations
- Gain-sparsity and symmetry-forced rigidity in the plane
- Spectral conditions for graph rigidity in the Euclidean plane
Cites work
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- A sufficient connectivity condition for generic rigidity in the plane
- Count matroids of group-labeled graphs
- Frameworks with forced symmetry. I: Reflections and rotations
- Gain-sparsity and symmetry-forced rigidity in the plane
- Global rigidity of periodic graphs under fixed-lattice representations
- Infinitesimal rigidity of symmetric bar-joint frameworks
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- Packing of rigid spanning subgraphs and spanning trees
- The Rigidity of Graphs
- The orbit rigidity matrix of a symmetric framework
Cited in
(4)
This page was built for publication: Sufficient connectivity conditions for rigidity of symmetric frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111186)