Minimally Globally Rigid Tensegrities on the Line
Graphs and Combinatorics · 2026-12 · 42 (6)
DOI: 10.1007/s00373-026-03081-1 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 16.11.2026. Verfasst von Adam D. W. Clay und 2 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal.
Abstract (Originalsprache)
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.
Förderung
- Nemzeti Kutatási Fejlesztési és Innovációs Hivatal
Zitieren
APA
Clay, A. D. W., Jordán, T., & Palmer, J. (2026). Minimally Globally Rigid Tensegrities on the Line. Graphs and Combinatorics, 42(6). https://doi.org/10.1007/s00373-026-03081-1
Vancouver
Clay ADW, Jordán T, Palmer J. Minimally Globally Rigid Tensegrities on the Line. Graphs and Combinatorics. 2026;42(6). doi:10.1007/s00373-026-03081-1
BibTeX
@article{Clay2026,
author = {Clay, Adam D. W. and Jordán, Tibor and Palmer, John},
title = {Minimally Globally Rigid Tensegrities on the Line},
journal = {Graphs and Combinatorics},
year = {2026},
volume = {42},
number = {6},
doi = {10.1007/s00373-026-03081-1}
}
EUVIMED