A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
From MaRDI portal
Publication:792636
DOI10.1016/0166-218X(84)90007-6zbMath0537.51027OpenAlexW1972582442MaRDI QIDQ792636
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90007-6
Composite and mixture properties (74E30) Applications of design theory to circuits and networks (94C30) Euclidean analytic geometry (51N20)
Related Items
An Analogy and Several Symmetries ⋮ On the two-dimensional generic rigidity matroid and its dual ⋮ Pebble game algorithms and sparse graphs ⋮ Sparse hypergraphs and pebble game algorithms ⋮ A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
Cites Work
- Unnamed Item
- Unnamed Item
- The rigidity of graphs. II
- Matroid matching and some applications
- On graphs and rigidity of plane skeletal structures
- Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
- Structural Rigidity I: Foundations and Rigidity Criteria
- Tensegrity Frameworks
- On Generic Rigidity in the Plane
- Unique solvability and order of complexity of linear networks containing memorylessn-ports
- Systems of distinct representatives and linear algebra
