加载中…
A simple graph is -rigid if its generic bar-joint frameworks in are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal -rigidity of a simple graph which is obtained from the -skeleton of a triangulated torus by the deletion of edges interior to a triangulated disc.

生成讲解博客的中文版本

生成AI智能校验的中文版本