Universal rigidity of complete bipartite graphs

DOI10.1007/s00454-016-9836-9zbMath1358.05073arXiv1502.02278OpenAlexW1604394219MaRDI QIDQ517442

Steven J. Gortler, Robert Connelly

Publication date: 23 March 2017

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02278

zbMATH Keywords

rigidityuniversal rigidityprestress stability

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Generically globally rigid graphs have generic universally rigid frameworks, Singularity Degree of the Positive Semidefinite Matrix Completion Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrices with high completely positive semidefinite rank
• On bar frameworks, stress matrices and semidefinite programming
• Characterizing the universal rigidity of generic frameworks
• Theory of semidefinite programming for sensor network localization
• Global rigidity: The effect of coning
• Infinitesimal motions of a bipartite framework
• Rigidity and energy
• When is a bipartite graph a rigid framework?
• An exact duality theory for semidefinite programming and its complexity implications
• On affine motions and bar frameworks in general position
• Iterative universal rigidity
• The Rigidity of Graphs
• Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
• Local, Dimensional and Universal Rigidities: A Unified Gram Matrix Approach