Strongly rigid tensegrity graphs on the line

Bill Jackson, Tibor Jordán, Csaba Király

Research output: Contribution to journalArticle


Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, which provide upper and/or lower bounds for the distance between their endpoints. The graph of the framework, in which edges are labeled as bars, cables, and struts, is called a tensegrity graph. It is said to be strongly rigid in Rd if every generic realization in Rd as a tensegrity framework is infinitesimally rigid. In this note we show that it is NP-hard to test whether a given tensegrity graph is strongly rigid in R1.

Original languageEnglish
Pages (from-to)1147-1149
Number of pages3
JournalDiscrete Applied Mathematics
Issue number7-8
Publication statusPublished - May 1 2013



  • Graph
  • NP-hard
  • Rigidity
  • Tensegrity framework

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this