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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Minimally Globally Rigid Tensegrities on the Line

Adam D. W. Clay, Tibor Jordán, John Palmer
1 links
Graphs and Combinatorics
Structural Analysis and Optimization
article

Minimally Globally Rigid Tensegrities on the Line

Adam D. W. Clay, Tibor Jordán, John Palmer
article en

Abstract

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.

Graphs and CombinatoricsVol. 42(6)
Eötvös Loránd University (HU), Purdue University West Lafayette (US), Hungarian Research Network (HU), Colorado State University (US)
Eötvös Loránd Tudományegyetem, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Structural Analysis and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon