The Rigidity of Graphs
From MaRDI portal
Publication:4173376
DOI10.2307/1998867zbMATH Open0392.05026OpenAlexW4242268215MaRDI QIDQ4173376FDOQ4173376
Authors:
Publication date: 1978
Full work available at URL: https://doi.org/10.2307/1998867
Kinematics of mechanisms and robots (70B15) Planar graphs; geometric and topological aspects of graph theory (05C10) Polytopes and polyhedra (52Bxx)
Cites Work
Cited In (only showing first 100 items - show all)
- Generalized weak rigidity: theory, and local and global convergence of formations
- The rigidity of certain cabled frameworks and the second-order rigidity of arbitrary triangulated convex surfaces
- Bipartite rigidity
- Symmetry-forced rigidity of frameworks on surfaces
- Rigidity and the Alexandrov-Fenchel inequality
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- Flexible circuits in the d‐dimensional rigidity matroid
- Tensegrity frameworks in one-dimensional space
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- Symmetric versions of Laman's theorem
- The orbit rigidity matrix of a symmetric framework
- Distances in a rigid unit-distance graph in the plane
- Local, dimensional and universal rigidities: a unified Gram matrix approach
- On dimensional rigidity of bar-and-joint frameworks
- Euclidean distance matrices, semidefinite programming and sensor network localization
- The rigidity of infinite graphs
- On the \(d\)-dimensional algebraic connectivity of graphs
- Equivalence of continuous, local and infinitesimal rigidity in normed spaces
- Graph rigidity via Euclidean distance matrices
- An inductive construction of minimally rigid body-hinge simple graphs
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- Angle-based shape determination theory of planar graphs with application to formation stabilization
- Finite motions from periodic frameworks with added symmetry
- Distance geometry and data science
- Frameworks symmetry and rigidity
- Coning, symmetry and spherical frameworks
- Infinitesimal rigidity of symmetric bar-joint frameworks
- Finite and infinitesimal rigidity with polyhedral norms
- Hyperconnectivity of graphs
- Covering a sphere by equal circles, and the rigidity of its graph
- The rigidity of graphs. II
- Rigidity and polynomial invariants of convex polytopes
- Crystal frameworks, matrix-valued functions and rigidity operators
- Bending of surfaces. II
- Improved packing of equal circles on a sphere and rigidity of its graph
- An improved bound for the rigidity of linearly constrained frameworks
- The isostatic conjecture
- Unique low rank completability of partially filled matrices
- Global completability with applications to self-consistent quantum tomography
- Geometric properties of Assur graphs
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Coincident rigidity of 2-dimensional frameworks
- A characterization of simplicial polytopes with \(g_{2}=1\)
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- The graphs behind reuleaux polyhedra
- One brick at a time: a survey of inductive constructions in rigidity theory
- On embeddability and stresses of graphs
- New classes of counterexamples to Hendrickson's global rigidity conjecture
- Finite point configurations in the plane, rigidity and Erdős problems
- Globally linked pairs of vertices in rigid frameworks
- Matroids of gain graphs in applied discrete geometry
- Weak Rigidity Theory and Its Application to Formation Stabilization
- Localization from incomplete noisy distance measurements
- How to describe or design a polyhedron
- Seven small pearls from convexity
- Extending a flexible unit-bar framework to a rigid one
- Sufficient connectivity conditions for rigidity of symmetric frameworks
- Rigidity and the lower bound theorem. I
- On the global rigidity of tensegrity graphs
- Structural rigidity. II: Almost infinitesimally rigid bar frameworks
- Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes
- On Generic Rigidity in the Plane
- On Some Problems in the Design of Plane Skeletal Structures
- Universal rigidity of complete bipartite graphs
- Tensegrity frameworks: static analysis review
- On Flattenability of Graphs
- Zero temperature limit for interacting Brownian particles. I: Motion of a single body.
- Sufficient conditions for the global rigidity of graphs
- Globally rigid augmentation of rigid graphs
- Spectral conditions for graph rigidity in the Euclidean plane
- On the dual rigidity matrix
- Rigidity and energy
- Graph rigidity for unitarily invariant matrix norms
- Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
- Graph rigidity properties of Ramanujan graphs
- Enumerating rigid sphere packings
- Calculating the symmetry number of flexible sphere clusters
- A lower bound theorem for centrally symmetric simplicial polytopes
- An asymptotic upper bound for graph embeddings
- Minimum cost globally rigid subgraphs
- New upper bounds for the number of embeddings of minimally rigid graphs
- On rigidity of unit-bar frameworks
- The rigidity of the graphs of homology spheres minus one edge
- A spatial unit-bar-framework which is rigid and triangle-free
- Combinatorial rigidity of incidence systems and application to dictionary learning
- Global rigidity of generic frameworks on the cylinder
- Globally rigid powers of graphs
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- Preface: Special issue dedicated to distance geometry
- Distinct distances on curves via rigidity
- Rigidity for sticky discs
- Infinitesimal Rigidity in Normed Planes
- Gradient-based bearing-only formation control: an elevation angle approach
- Sign rigidity theory and application to formation specification control
- Globally rigid graphs are fully reconstructible
- Generic unlabeled global rigidity
- Graph reconstruction from unlabeled edge lengths
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Generic symmetry-forced infinitesimal rigidity: translations and rotations
- Generically globally rigid graphs have generic universally rigid frameworks
This page was built for publication: The Rigidity of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4173376)
