Year: 2026
Type: article
Abstract: A tensegrity graph T is called weakly (globally) rigid in $$\mathbb {R}^d$$ 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 $$\mathbb {R}^1$$ R 1 , in terms of the number of vertices. We also characterize the extremal graphs.
Source: Graphs and Combinatorics
Authors: Adam D. W. Clay, Tibor Jordán, John Palmer
Language: English
Subfield: Civil and Structural Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,190
Awards: G2185027241, G9001387748
OpenAlex ID: W7234436893
