Fundamental Materials Research
DOI: 10.1007/0-306-47089-6_2
|View full text |Cite
|
Sign up to set email alerts
|

Rigidity of Molecular Structures: Generic and Geometric Analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
29
0

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(30 citation statements)
references
References 21 publications
1
29
0
Order By: Relevance
“…The detailed calculation can be seen in [3,Proposition 3.4] or [33,Proposition 3] for the 3-dimensional case and the technique can apply to the general dimensional case without any modification.…”
Section: Proof Of the Molecular Conjecturementioning
confidence: 99%
See 1 more Smart Citation
“…The detailed calculation can be seen in [3,Proposition 3.4] or [33,Proposition 3] for the 3-dimensional case and the technique can apply to the general dimensional case without any modification.…”
Section: Proof Of the Molecular Conjecturementioning
confidence: 99%
“…As we mentioned in Introduction, in 3-dimensional space the projective dual of nonparallel paneland-hinge frameworks are "hinge-concurrent" body-and-hinge frameworks, which are also called molecular frameworks [14,33] because they are used to study the flexibility of molecules. Since the infinitesimal rigidity is invariant under the duality [3, Section 3.6] (see also [29] for more detailed descriptions on the related topic), it follows from Theorem 6.7 that a simple graph G = (V, E) can be realized as a molecular framework (G, p) which satisfies rank R(…”
Section: Proof Let K = Def( G) By Proposition 32 We Have Rank R(gmentioning
confidence: 99%
“…This conjecture was given by Tay and Whiteley in [15], and subsequently appeared in several different forms, see [18,19,20,21,22]. It is usually formulated in terms of 'body-and-hinge' frameworks, which will be described in Subsection 2.1.…”
Section: Rigid Graphs and Frameworkmentioning
confidence: 99%
“…In this paper we consider an important special case, which has been a focus of recent research: characterize when the square of a graph is rigid, where the square G 2 of a graph G is obtained from G by adding a new edge uv for each pair u, v ∈ V (G) of distance two in G, see Figure 1. Squares of graphs are sometimes called molecular graphs, because they are used to study the flexibility of molecules, particularly biomolecules such as proteins [19,22]. Franzblau [1,2] has developed combinatorial algorithms for computing lower and upper bounds on the degrees of freedom of molecular graphs using ear-decompositions of graphs.…”
Section: Introductionmentioning
confidence: 99%
“…It is possible to devise internal coordinate systems which use only distances as coordinates; this approach is related to distance geometry [18] and rigidity theory [36], [85]. For attempts in two dimensions to utilize both distances and angles as internal coordinates, see [88], [89]. Internal coordinate systems which are based on collections of bond lengths, bond angles, and torsion angles [70], [82], are loosely called valence coordinates by chemists, but until recently [31] there has been little effort to understand exactly which combinations of these valence coordinates form "good" internal coordinate systems.…”
Section: Introductionmentioning
confidence: 99%