The Rigidity of Infinite Graphs II

Kitson, Derek and Power, Stephen (2022) The Rigidity of Infinite Graphs II. Graphs and Combinatorics, 38 (3). ISSN 0911-0119

Text (RoIG_2 21Feb_2022scp)
RoIG_2_21Feb_2022scp.pdf - Accepted Version
Restricted to Repository staff only until 13 April 2023.
Available under License Creative Commons Attribution.

Download (263kB)


Inductive constructions are established for countably infinite simple graphs which have minimally rigid locally generic placements in R^2. This generalises a well-known result of Henneberg for generically rigid finite graphs. Inductive methods are also employed in the determination of the infinitesimal flexibility dimension of countably infinite graphs associated with infinitely faceted convex polytopes in R^3. In particular, a generalisation of Cauchy's rigidity theorem is obtained.

Item Type:
Journal Article
Journal or Publication Title:
Graphs and Combinatorics
Additional Information:
The final publication is available at Springer via
Uncontrolled Keywords:
ID Code:
Deposited By:
Deposited On:
21 Mar 2022 14:05
Last Modified:
22 Nov 2022 11:16