Global rigidity of periodic graphs under fixed-lattice representations
From MaRDI portal
Publication:2221925
Abstract: In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in . Jackson and Jordan confirmed in 2005 that these conditions are also sufficient in , giving a combinatorial characterization of graphs whose generic realizations in are globally rigid. In this paper, we establish analogues of these results for infinite periodic frameworks under fixed lattice representations. Our combinatorial characterization of globally rigid generic periodic frameworks in in particular implies toroidal and cylindrical counterparts of the theorem by Jackson and Jordan.
Recommendations
- Sufficient conditions for the global rigidity of periodic graphs
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Sufficient conditions for the global rigidity of graphs
- Sufficient conditions for 2-dimensional global rigidity
- Generic global rigidity of body-hinge frameworks
Cites work
- scientific article; zbMATH DE number 3493472 (Why is no real title available?)
- scientific article; zbMATH DE number 3221041 (Why is no real title available?)
- A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid.
- Characterizing generic global rigidity
- Combinatorial rigidity. Graphs and matroids in the theory of rigid frameworks
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Frameworks with forced symmetry. I: Reflections and rotations
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Gain-sparsity and symmetry-forced rigidity in the plane
- Generic combinatorial rigidity of periodic frameworks
- Generic global rigidity
- Global rigidity of generic frameworks on the cylinder
- Globally linked pairs of vertices in equivalent realizations of graphs
- Independence and port oracles for matroids, with an application to computational learning theory
- Inductive constructions for frameworks on a two-dimensional fixed torus
- Necessary conditions for the generic global rigidity of frameworks on surfaces
- Necessary conditions for the global rigidity of direction-length frameworks
- On graphs and rigidity of plane skeletal structures
- Rigidity and energy
- Stress matrices and global rigidity of frameworks on surfaces
- Sufficient conditions for the global rigidity of graphs
- The Rigidity of Graphs
- The rigidity of periodic frameworks as graphs on a fixed torus
- Unique low rank completability of partially filled matrices
Cited in
(11)- Graph rigidity properties of Ramanujan graphs
- Generically globally rigid zeolites in the plane
- Flexible placements of periodic graphs in the plane
- Globally rigid powers of graphs
- Minimally rigid periodic graphs
- Sufficient conditions for 2-dimensional global rigidity
- Sufficient conditions for the global rigidity of periodic graphs
- The rigidity of periodic body-bar frameworks on the three-dimensional fixed torus
- Sufficient connectivity conditions for rigidity of symmetric frameworks
- Global Rigidity of Unit Ball Graphs
- Sufficient conditions for the global rigidity of graphs
This page was built for publication: Global rigidity of periodic graphs under fixed-lattice representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221925)