Answers are grounded in this paper and cite their sources.
A tensegrity graph T is called weakly (globally) rigid in Rᵈ R d if there exits a (globally) rigid d -dimensional generic tensegrity framework whose underlying graph is T . We prove tight upper bounds on the number of edges of a minimally weakly (globally) rigid tensegrity graph in R¹ R 1 , in terms of the number of vertices. We also characterize the extremal graphs.
No takes yet. Share an insight, caveat, or question.
Clay et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: