| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653647 | European Journal of Combinatorics | 2013 | 8 Pages |
Abstract
We also prove the reverse implication: if G is a k-connected graph for some kâ¥6 then its two-dimensional rigidity matroid is (kâ2)-connected. Furthermore, we determine the connectivity of the d-dimensional rigidity matroid of the complete graph Kn, for all pairs of positive integers d,n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Tibor Jordán, Viktória E. Kaszanitzky,