Rigid tensegrity labelings of graphs
From MaRDI portal
Publication:1041607
DOI10.1016/j.ejc.2008.12.014zbMath1226.05216OpenAlexW1979177743MaRDI QIDQ1041607
Tibor Jordán, András Recski, Zoltán Szabadka
Publication date: 3 December 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2008.12.014
Related Items (8)
Geometric and material nonlinear analysis of tensegrity structures ⋮ Topology optimization of tensegrity structures under compliance constraint: a mixed integer linear programming approach ⋮ Bracing rhombic structure by one-dimensional tensegrities ⋮ Strongly rigid tensegrity graphs on the line ⋮ Form-finding of tensegrity structures with multiple states of self-stress ⋮ Determination of a unique configuration of free-form tensegrity structures ⋮ Topology design of tensegrity structures via mixed integer programming ⋮ On characterizations of rigid graphs in the plane using spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rigidity and energy
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Connected rigidity matroids and unique realizations of graphs
- Tensegrity Frameworks
- Dividing a Graph into Triconnected Components
- Second-Order Rigidity and Prestress Stability for Tensegrity Frameworks
- Algorithms - ESA 2003
This page was built for publication: Rigid tensegrity labelings of graphs
