Graph connectivity and universal rigidity of bar frameworks
From MaRDI portal
Publication:516906
DOI10.1016/J.DAM.2016.10.008zbMATH Open1358.05154arXiv1407.2199OpenAlexW2507911378MaRDI QIDQ516906FDOQ516906
Authors: Abdo Y. Alfakih
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: Let be a graph on nodes. In this note, we prove that if is -vertex connected, , then there exists a configuration in general position in such that the bar framework is universally rigid. The proof is constructive and is based on a theorem by Lovasz et al concerning orthogonal representations and connectivity of graphs [12,13].
Full work available at URL: https://arxiv.org/abs/1407.2199
Recommendations
connectivity of graphsuniversal rigidityorthogonal representationbar frameworksstress and Gale matrices
Cites Work
- On the Shannon capacity of a graph
- Conditions for Unique Graph Realizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rigidity and energy
- Orthogonal representations and connectivity of graphs
- Characterizing the universal rigidity of generic frameworks
- A correction: Orthogonal representations and connectivity of graphs
- Graphs with magnetic Schrödinger operators of low corank
- On dimensional rigidity of bar-and-joint frameworks
- When is a bipartite graph a rigid framework?
- On affine motions and bar frameworks in general position
- On affine motions and universal rigidity of tensegrity frameworks
- On the universal rigidity of generic bar frameworks
Cited In (4)
This page was built for publication: Graph connectivity and universal rigidity of bar frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516906)