The Rigidity of Graphs
From MaRDI portal
Publication:4173376
Cites work
Cited in
(only showing first 100 items - show all)- Spectral conditions for graph rigidity in the Euclidean plane
- Exploring the rigidity of planar configurations of points and rods
- Rigidity and energy
- On the dual rigidity matrix
- Generalized weak rigidity: theory, and local and global convergence of formations
- Closing ranks in rigid multi-agent formations using edge contraction
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Graph rigidity for unitarily invariant matrix norms
- Combinatorial rigidity and independence of generalized pinned subspace-incidence constraint systems
- Graph rigidity properties of Ramanujan graphs
- The rigidity of certain cabled frameworks and the second-order rigidity of arbitrary triangulated convex surfaces
- Symmetry-forced rigidity of frameworks on surfaces
- Rigidity and the Alexandrov-Fenchel inequality
- Bipartite rigidity
- Calculating the symmetry number of flexible sphere clusters
- Enumerating rigid sphere packings
- A lower bound theorem for centrally symmetric simplicial polytopes
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- Tensegrity frameworks in one-dimensional space
- An asymptotic upper bound for graph embeddings
- A characterisation of the generic rigidity of 2-dimensional point-line frameworks
- New upper bounds for the number of embeddings of minimally rigid graphs
- Flexible circuits in the d‐dimensional rigidity matroid
- Minimum cost globally rigid subgraphs
- The rigidity of the graphs of homology spheres minus one edge
- On rigidity of unit-bar 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
- Computing maximum likelihood thresholds using graph rigidity
- Partial reflections and globally linked pairs in rigid graphs
- A spatial unit-bar-framework which is rigid and triangle-free
- Combinatorial rigidity of incidence systems and application to dictionary learning
- Euclidean distance matrices, semidefinite programming and sensor network localization
- On dimensional rigidity of bar-and-joint frameworks
- Local, dimensional and universal rigidities: a unified Gram matrix approach
- The rigidity of infinite graphs
- Maximum likelihood thresholds via graph rigidity
- Global rigidity of generic frameworks on the cylinder
- Rigidity percolation in disordered 3D rod systems
- Globally rigid powers of graphs
- Equivalence of continuous, local and infinitesimal rigidity in normed spaces
- Dense graphs have rigid parts
- Graph rigidity via Euclidean distance matrices
- On the \(d\)-dimensional algebraic connectivity of graphs
- Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
- An inductive construction of minimally rigid body-hinge simple graphs
- Preface: Special issue dedicated to distance geometry
- Angle-based shape determination theory of planar graphs with application to formation stabilization
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- Spectral radius conditions for the rigidity of graphs
- Equilibrium stresses and rigidity for infinite tensegrities and frameworks
- Finite motions from periodic frameworks with added symmetry
- Distinct distances on curves via rigidity
- Distance geometry and data science
- Coning, symmetry and spherical frameworks
- Gradient-based bearing-only formation control: an elevation angle approach
- Sign rigidity theory and application to formation specification control
- Frameworks symmetry and rigidity
- Rigidity for sticky discs
- Finite and infinitesimal rigidity with polyhedral norms
- Infinitesimal Rigidity in Normed Planes
- Infinitesimal rigidity of symmetric bar-joint frameworks
- Hyperconnectivity of graphs
- Covering a sphere by equal circles, and the rigidity of its graph
- Preface
- Globally rigid graphs are fully reconstructible
- Generic unlabeled global rigidity
- The rigidity of graphs. II
- Graph reconstruction from unlabeled edge lengths
- Rigidity and polynomial invariants of convex polytopes
- Stability of \(\mathbb{Z}^2\) configurations in 3D
- Moduli spaces of polygons and deformations of polyhedra with boundary
- Bending of surfaces. II
- Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
- Crystal frameworks, matrix-valued functions and rigidity operators
- Unique low rank completability of partially filled matrices
- Global completability with applications to self-consistent quantum tomography
- Sufficient conditions for 2-dimensional global rigidity
- Improved packing of equal circles on a sphere and rigidity of its graph
- The isostatic conjecture
- Geometric properties of Assur graphs
- An improved bound for the rigidity of linearly constrained frameworks
- Affine stresses: the partition of unity and Kalai's reconstruction conjectures
- A sufficient connectivity condition for rigidity and global rigidity of linearly constrained frameworks in \(\mathbb{R}^2\)
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
- Trilateration using unlabeled path or loop lengths
- A characterization of simplicial polytopes with \(g_{2}=1\)
- Coincident rigidity of 2-dimensional frameworks
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Generically globally rigid graphs have generic universally rigid frameworks
- Frameworks with forced symmetry. II: Orientation-preserving crystallographic groups
- Generic symmetry-forced infinitesimal rigidity: translations and rotations
- The first-order flexibility of a crystallographic framework
- Coincident-point rigidity in normed planes
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- The graphs behind reuleaux polyhedra
- Global rigidity of (quasi-)injective frameworks on the line
- Bipartite rigidity
- On embeddability and stresses of graphs
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)
