Author: Brigitte Servatius

Reference: J. of Combinatorial Theory B, 53 (1), 106--113, 1991.

Abstract: We consider the 2-dimensional generic rigidity matroid $R(G)$ of a graph $G$ and give a characterization of the dual of $R(G)$. We show that the connectivity of $R(G)$ implies the birigidity of $G$ but not conversely. Finally we give necessary and sufficient conditions for a connected matroid to be the rigidity matroid of a birigid graph. Other articles on Structural Rigidity