A combinatorial study of the rigidity of planar structures (Q581093)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4018556
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial study of the rigidity of planar structures |
scientific article; zbMATH DE number 4018556 |
Statements
A combinatorial study of the rigidity of planar structures (English)
0 references
1986
0 references
The flexibility analysis of a planar structure can be done via a primary or released statically determinate substructure. The graph model of the searching algorithm, called \(\gamma\)-tree, is formed by expanding elementary subgraphs. The main difficulty subsists in the computer recognition of such elementary subgraphs. For general cases the \textit{L. Lováz} and \textit{Y. Yemini} method [SIAM Algebraic Discrete Methods 3, 91-98 (1982; Zbl 0497.05025)] or the \textit{K. Sugihara} method [ibid. 4, 355-362 (1983; Zbl 0542.51021)] can be used. The paper reveals the mathematical background of graph expansion and its correlation with related concepts of the Lovaz and Yemini respectively Sugihara methods.
0 references
rigidity
0 references
gamma-tree
0 references
skeletal structure
0 references
flexibility
0 references
planar structure
0 references
expanding elementary subgraphs
0 references
computer recognition
0 references
0.7868556380271912
0 references
0.7354865670204163
0 references
0.7272244691848755
0 references
