The generic minimal rigidity of a partially triangulated torus
classification
🧮 math.CO
math.MG
keywords
triangulatedgenericgraphminimalobtainedrigidrigiditysimple
read the original abstract
A simple graph is $3$-rigid if its generic bar-joint frameworks in $R^3$ are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal $3$-rigidity of a simple graph which is obtained from the $1$-skeleton of a triangulated torus by the deletion of edges interior to a triangulated disc.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.