Highly connected molecular graphs are rigid in three dimensions

Authors:
Tibor Jordán
Affiliations:
Department of Operations Research, Eötvös University, Pázmány Péter sétány 1/C, 1117 Budapest, Hungary
Venue:
Information Processing Letters
Year:
2012

Citing 6
Cited 0

Rigidity and scene analysis

Handbook of discrete and computational geometry
Rigid Components in Molecular Graphs

Algorithmica
The 2-dimensional rigidity of certain families of graphs

Journal of Graph Theory
Note: A sufficient connectivity condition for generic rigidity in the plane

Discrete Applied Mathematics
On the rigidity of molecular graphs

Combinatorica
A Proof of the Molecular Conjecture

Discrete & Computational Geometry - Special Issue: 25th Annual Symposium on Computational Geometry; Guest Editor: John Hershberger

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that every 7-vertex-connected molecular graph is generically rigid in three dimensions. This verifies a special case of a conjecture of Lovasz and Yemini. For this family of graphs the bound is best possible.