arXiv · 1011.3208
Rigidity of Graph Joins and Hendrickson's Conjecture
Abstract
Whiteley \cite{wh} 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 $\R^5$ and above to Hendrickson's conjecture on generic global rigidity.
Explore related subjects
Keep this discovery
Timothy Sun, Chun Ye. 2010-11-14. Rigidity of Graph Joins and Hendrickson's Conjecture. https://arxiv.org/abs/1011.3208
Cite the original work for its findings. Save a collection to share your selection of sources.