Minimum size highly redundantly rigid graphs in the plane

DOI10.1007/s00373-021-02327-4OpenAlexW3163468434MaRDI QIDQ2042216

Tibor Jordán

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02327-4

zbMATH Keywords

global rigidityrigid frameworkrigid graphredundantly rigid graph

Mathematics Subject Classification ID

Discrete geometry (52Cxx) Artificial intelligence (68Txx) Graph theory (05Cxx) Designs and configurations (05Bxx) General systems theory (93Axx)

Related Items (2)

Four-regular graphs with extremal rigidity properties ⋮ Extremal families of redundantly rigid graphs in three dimensions

Cites Work

• Unnamed Item
• Connected rigidity matroids and unique realizations of graphs
• Sufficient conditions for the global rigidity of graphs
• Generic global rigidity
• Development of redundant rigidity theory for formation control
• Addressing agent loss in vehicle formations and sensor networks
• Birigidity in the Plane
• On the robustness to multiple agent losses in 2D and 3D formations
• Conditions for Unique Graph Realizations
• The Molecule Problem: Exploiting Structure in Global Optimization
• On minimally highly vertex-redundantly rigid graphs

This page was built for publication: Minimum size highly redundantly rigid graphs in the plane