Abstract
A simple graph is 3-rigid if its generic embeddings in R 3 are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal 3-rigidity of a simple graph obtained from a triangulated torus by the deletion of edges interior to an embedded triangulated disc.
| Original language | English |
|---|---|
| Pages (from-to) | 1277-1304 |
| Number of pages | 28 |
| Journal | Proceedings of the London Mathematical Society |
| Volume | 118 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - May 2019 |
Keywords
- 05C25 (primary)
- 52C25
Fingerprint
Dive into the research topics of 'The rigidity of a partially triangulated torus'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver