rigid framework

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. In this work, such a graph is instead referred to using the more common term "identity graph" (e.g., Albertson and Collins 1996).

braced polygon | flexible graph | flexible polyhedron | framework | graph bar | Harborth graph | identity graph | just rigid | Laman graph | Laman's theorem | Liebmann's theorem | rigidity matrix | rigidity theorem | rigid polyhedron | tensegrity | unit-distance graph