Sciweavers

CORR
2010
Springer

Rigidity of Graph Joins and Hendrickson's Conjecture

13 years 4 months ago
Rigidity of Graph Joins and Hendrickson's Conjecture
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined graphs, a family of graphs that contain the complete bipartite graphs. We use this characterization to identify new families of counterexamples, including infinite families, in R5 and above to Hendrickson's conjecture on generic global rigidity.
Timothy Sun, Chun Ye
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors Timothy Sun, Chun Ye
Comments (0)