Graph connectivity and universal rigidity of bar frameworks

DOI10.1016/J.DAM.2016.10.008MaRDI QIDQ516906zbMATH OpenOpenAlexFDO

Authors Abdo Y. Alfakih

Publication date 15 March 2017

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

Full work available at URL https://arxiv.org/abs/1407.2199

zbMATH Keywords

connectivity of graphsuniversal rigidityorthogonal representationbar frameworksstress and Gale matrices

Mathematics Subject Classification ID

Connectivity (05C40)

Abstract: Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1leqrleqn-2$, then there exists a configuration $p$ in general position in $R^r$ 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].

Recommendations

• On the universal rigidity of generic bar frameworks
• Generically globally rigid graphs have generic universally rigid frameworks
• On affine motions and bar frameworks in general position
• Universal rigidity of bar frameworks via the geometry of spectrahedra
• Iterative universal rigidity

Cites work

• scientific article; zbMATH DE number 3121295 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• A correction: Orthogonal representations and connectivity of graphs
• Characterizing the universal rigidity of generic frameworks
• Conditions for Unique Graph Realizations
• Graphs with magnetic Schrödinger operators of low corank
• On affine motions and bar frameworks in general position
• On affine motions and universal rigidity of tensegrity frameworks
• On dimensional rigidity of bar-and-joint frameworks
• On the Shannon capacity of a graph
• On the universal rigidity of generic bar frameworks
• Orthogonal representations and connectivity of graphs
• Rigidity and energy
• When is a bipartite graph a rigid framework?

Cited in

(4)

• Book review of: L. Lovász, Graphs and geometry
• Generically globally rigid graphs have generic universally rigid frameworks
• Global rigidity of (quasi-)injective frameworks on the line
• Super stable tensegrities and the Colin de Verdière number \(\nu\)

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)