Sufficient connectivity conditions for rigidity of symmetric frameworks
DOI10.1016/J.EJC.2022.103639zbMATH Open1505.05077arXiv1804.10458OpenAlexW2798549590MaRDI QIDQ2111186FDOQ2111186
Bernd Schulze, Viktória E. Kaszanitzky
Publication date: 28 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.10458
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)
Cites Work
- Count matroids of group-labeled graphs
- On graphs and rigidity of plane skeletal structures
- Gain-sparsity and symmetry-forced rigidity in the plane
- Title not available (Why is that?)
- Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks
- The orbit rigidity matrix of a symmetric framework
- Frameworks with forced symmetry. I: Reflections and rotations
- On Generic Rigidity in the Plane
- The Rigidity of Graphs
- A sufficient connectivity condition for generic rigidity in the plane
- Packing of rigid spanning subgraphs and spanning trees
- Global rigidity of periodic graphs under fixed-lattice representations
Cited In (3)
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)