pith. sign in

arxiv: 1011.3208 · v2 · pith:W7A5F5NUnew · submitted 2010-11-14 · 🧮 math.MG · cs.DM

Rigidity of Graph Joins and Hendrickson's Conjecture

classification 🧮 math.MG cs.DM
keywords completegraphsbipartitecharacterizationconjecturefamilieshendricksoninfinitesimal
0
0 comments X
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.