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 Edit this on Wikidata


Publication date: 15 March 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: Let G be a graph on n nodes. In this note, we prove that if G is (r+1)-vertex connected, 1leqrleqn2, then there exists a configuration p in general position in Rr such that the bar framework (G,p) 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




Cites Work


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)