| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654068 | European Journal of Combinatorics | 2010 | 8 Pages |
Abstract
The edge set of a graph GG is partitioned into two subsets EC∪ESEC∪ES. A tensegrity framework with underlying graph GG and with cables for ECEC and struts for ESES is proved to be rigidly embeddable into a one-dimensional line if and only if GG is 2-edge-connected and every 2-vertex-connected component of GG intersects both ECEC and ESES. Polynomial algorithms are given for finding an embedding of such graphs and for checking the rigidity of a given one-dimensional embedding.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
András Recski, Offer Shai,