Rigidity of Graph Joins and Hendrickson's Conjecture
classification
🧮 math.MG
cs.DM
keywords
completegraphsbipartitecharacterizationconjecturefamilieshendricksoninfinitesimal
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.