Sufficient connectivity conditions for rigidity of symmetric frameworks

From MaRDI portal
Publication:2111186

DOI10.1016/J.EJC.2022.103639zbMATH Open1505.05077arXiv1804.10458OpenAlexW2798549590MaRDI QIDQ2111186FDOQ2111186

Bernd Schulze, Viktória E. Kaszanitzky

Publication date: 28 December 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: It is a famous result of Lovasz and Yemini (1982) that 6-connected graphs are rigid in the plane. This was recently improved by Jackson and Jordan (2009) who showed that 6-mixed connectivity is also sufficient for rigidity. Here we give sufficient graph connectivity conditions for both `forced symmetric' and `incidentally symmetric' infinitesimal rigidity in the plane.


Full work available at URL: https://arxiv.org/abs/1804.10458




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Sufficient connectivity conditions for rigidity of symmetric frameworks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111186)