On minimally highly vertex-redundantly rigid graphs

DOI10.1007/s00373-015-1560-3zbMath1338.05187OpenAlexW1983014608MaRDI QIDQ5964987

Csaba Király, Viktória E. Kaszanitzky

Publication date: 2 March 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-015-1560-3

zbMATH Keywords

bar-joint frameworksvertex-redundant rigidity

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Ear‐decompositions, minimally connected matroids and rigid graphs ⋮ On minimally highly vertex-redundantly rigid graphs ⋮ Minimum size highly redundantly rigid graphs in the plane ⋮ Extremal families of redundantly rigid graphs in three dimensions ⋮ Minimally globally rigid graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global rigidity: The effect of coning
• On graphs and rigidity of plane skeletal structures
• Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)
• 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
• On minimally highly vertex-redundantly rigid graphs