A sufficient connectivity condition for generic rigidity in the plane

DOI10.1016/j.dam.2008.12.003zbMath1180.05059OpenAlexW2087647500MaRDI QIDQ1026167

Bill Jackson, Tibor Jordán

Publication date: 24 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.12.003

zbMATH Keywords

globally rigid graphrigid graphmixed connectivityredundantly rigid graph

Mathematics Subject Classification ID

Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40)

Related Items

On the robustness to multiple agent losses in 2D and 3D formations, Spanning Rigid Subgraph Packing and Sparse Subgraph Covering, Spectral radius conditions for the rigidity of graphs, Packing of rigid spanning subgraphs and spanning trees, Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs, Graph rigidity properties of Ramanujan graphs, Highly connected molecular graphs are rigid in three dimensions, Sufficient Conditions for 2-Dimensional Global Rigidity, Spectral conditions for graph rigidity in the Euclidean plane, Combining globally rigid frameworks, Minimally globally rigid graphs, Sufficient connectivity conditions for rigidity of symmetric frameworks

Cites Work

• Unnamed Item
• Unnamed Item
• Connected rigidity matroids and unique realizations of graphs
• On minimally \((n,\lambda)\)-connected graphs
• Generic global rigidity
• Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
• On graphs and rigidity of plane skeletal structures
• The 2-dimensional rigidity of certain families of graphs
• On Generic Rigidity in the Plane