Minimally Globally Rigid Tensegrities on the Line
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.
Authors
- Adam D. W. Clay
- Tibor Jordán (ORCID: https://orcid.org/0000-0003-3662-5558)
- John Palmer
Institutions
- Eötvös Loránd University (HU)
- Purdue University West Lafayette (US)
- Hungarian Research Network (HU)
- Colorado State University (US)
Publication Details
- Journal
- Graphs and Combinatorics
- Published
- 2026-11-16
- DOI
- https://doi.org/10.1007/s00373-026-03081-1
- Primary Topic
- Structural Analysis and Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Eötvös Loránd Tudományegyetem
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal