On the rigidity of molecular graphs

DOI10.1007/S00493-008-2287-ZMaRDI QIDQ1046739zbMATH OpenOpenAlexFDO

Authors Bill Jackson, Tibor Jordán

Publication date 28 December 2009

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00493-008-2287-z

zbMATH Keywords

molecular conjecturerigidity of graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25)

Review text

A graph is called rigid if a generic bar-and-joint framework corresponding to it is rigid in the usual (kinematic) sense. The authors study the rigidity of squares of graphs, which are also called molecular graphs because they are used to study the flexibility of molecules. The Molecular Conjecture, posed in 1984 by \textit{T. S. Tay} and \textit{W. Whiteley} [Topologie Struct. 9, 31--38 (1984; Zbl 0541.51021)], states that the square \(G^{2}\) of a graph \(G\) of minimum degree at least two is rigid if and only if \(5G\) contains six edge-disjoint spanning trees. The main result of the paper under review is a lower bound on the degrees of freedom of \(G^{2}\) in terms of forest covers of \(G\). This implies that the existence of the above six spanning trees is a necessary condition for the rigidity of \(G^{2}\).

Recommendations

• Rigid components in molecular graphs
• Globally rigid powers of graphs
• A proof of the molecular conjecture
• Highly connected molecular graphs are rigid in three dimensions
• Pin-collinear body-and-pin frameworks and the molecular conjecture

Cites work

• Brick partitions of graphs
• Combinatorial Algorithm for a Lower Bound on Frame Rigidity
• Edge-Disjoint Spanning Trees of Finite Graphs
• Generic rigidity in three-dimensional bond-bending networks
• Generic rigidity of molecular graphs via ear decomposition
• scientific article; zbMATH DE number 3859878 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 952952 (Why is no real title available?)
• Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
• On the Problem of Decomposing a Graph into n Connected Factors
• ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Rigid components in molecular graphs
• The d-dimensional rigidity matroid of sparse graphs
• The Dress conjectures on rank in the 3-dimensional rigidity matroid
• The generic rank of body-bar-and-hinge frameworks
• The Union of Matroids and the Rigidity of Frameworks

Cited in

(11)

• Minimal NMR distance information for rigidity of protein graphs
• Generic rigidity of molecular graphs via ear decomposition
• Generic rigidity of square grid graph
• Globally rigid powers of graphs
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers
• Highly connected molecular graphs are rigid in three dimensions
• A proof of the molecular conjecture
• Combinatorial models of rigidity and renormalization
• Pin-collinear body-and-pin frameworks and the molecular conjecture
• Rigid components in molecular graphs

This page was built for publication: On the rigidity of molecular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1046739)