Sufficient connectivity conditions for rigidity of symmetric frameworks

DOI10.1016/j.ejc.2022.103639zbMath1505.05077arXiv1804.10458OpenAlexW2798549590MaRDI QIDQ2111186

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

zbMATH Keywords

globally rigid graphrigid graphmixed connectivityredundantly rigid graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)

Cites Work

• Unnamed Item
• Gain-sparsity and symmetry-forced rigidity in the plane
• Packing of rigid spanning subgraphs and spanning trees
• The orbit rigidity matrix of a symmetric framework
• Frameworks with forced symmetry. I: Reflections and rotations
• A sufficient connectivity condition for generic rigidity in the plane
• Count matroids of group-labeled graphs
• Global rigidity of periodic graphs under fixed-lattice representations
• On graphs and rigidity of plane skeletal structures
• On Generic Rigidity in the Plane
• The Rigidity of Graphs
• Infinitesimal Rigidity of Symmetric Bar-Joint Frameworks

This page was built for publication: Sufficient connectivity conditions for rigidity of symmetric frameworks