Plane four-regular graphs with vertex-to-vertex unit triangles
Discrete Mathematics - Special volume: Designs and Graphs
Handbook of discrete and computational geometry
Connected rigidity matroids and unique realizations of graphs
Journal of Combinatorial Theory Series B
Pin-Collinear Body-and-Pin Frameworks and the Molecular Conjecture
Discrete & Computational Geometry
Hi-index | 0.89 |
A d-dimensional zeolite is a d-dimensional body-and-pin framework with a (d+1)-regular underlying graph G. That is, each body of the zeolite is incident with d+1 pins and each pin belongs to exactly two bodies. The corresponding d-dimensional combinatorial zeolite is a bar-and-joint framework whose graph is the line graph of G. We show that a two-dimensional combinatorial zeolite is generically globally rigid if and only if its underlying 3-regular graph G is 3-edge-connected. The proof is based on a new rank formula for the two-dimensional rigidity matroid of line graphs.