Note: A sufficient connectivity condition for generic rigidity in the plane

Authors:
Bill Jackson;Tibor Jordán
Affiliations:
School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London E1 4NS, England, United Kingdom;Department of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, 1117 Budapest, Hungary
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 5
Cited 3

On minimally (n, &lgr;)-connected graphs

Journal of Combinatorial Theory Series B
Generic Global Rigidity

Discrete & Computational Geometry
Connected rigidity matroids and unique realizations of graphs

Journal of Combinatorial Theory Series B
The 2-dimensional rigidity of certain families of graphs

Journal of Graph Theory
Sparse certificates and removable cycles in l-mixed p-connected graphs

Operations Research Letters

Understanding node localizability of wireless ad-hoc networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Survey Paper: Theoretic analysis of unique localization for wireless sensor networks

Ad Hoc Networks
Highly connected molecular graphs are rigid in three dimensions

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

A graph G=(V,E) is said to be 6-mixed-connected if G-U-D is connected for all sets U@?V and D@?E which satisfy 2|U|+|D|@?5. In this note we prove that 6-mixed-connected graphs are (redundantly globally) rigid in the plane. This improves on a previous result of Lovasz and Yemini.