A combinatorial study of the rigidity of planar structures
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.
scientific article; zbMATH DE number 4018556