期刊
SIAM JOURNAL ON DISCRETE MATHEMATICS
卷 27, 期 2, 页码 991-1020出版社
SIAM PUBLICATIONS
DOI: 10.1137/100801044
关键词
generic rigidity; spherical polyhedra; vertex splitting; mathematical allostery
资金
- NSERC
- York University
- NSERC (Canada)
A long-standing problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class, the triangulated convex spheres, but there is an ongoing desire for further classes. We provide such a class, along with methods for verifying generic rigidity that can be extended to other classes. These methods are based on a controlled sequence of vertex splits, a graph theoretic operation known to take a minimally generically rigid framework to a new minimally generically rigid framework with one more vertex. One motivation for this is to have well-understood frameworks which can be used to explore mathematical allostery-frameworks in which adding bars at one site causes changes in rigidity at a distant site. This is an initial step in exploring the possibility of mechanical models for an important behavior in proteins.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据