Rigid components in molecular graphs

Bill Jackson, Tibor Jordán

Published in:
Algorithmica, Vol. 48, No. 4 (2007) 399-412.


In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Whiteley, indicates that determining rigidity (or more generally, computing the degree of freedom) of squares of graphs may be tractable by combinatorial methods. We show that the truth of the Molecular Conjecture would imply an efficient algorithm to identify the maximal rigid subgraphs of a molecular graph. In addition, we prove that the truth of two other conjectures in combinatorial rigidity (due to A. Dress and D. Jacobs, respectively) would imply the truth of the Molecular Conjecture.

Bibtex entry:

AUTHOR = {Jackson, Bill and Jord{\'a}n, Tibor},
TITLE = {Rigid components in molecular graphs},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2006},
NUMBER = {TR-2006-03}

Last modification: 13.3.2018. Please email your comments to Tamás Király!