
doi: 10.1007/bf01858467
A graph of order \(\geq 3\) whose vertices (called joints) are points in \(\mathbb{R}^n\) and whose edges (called bars) are line segments connecting two vertices has been considered as a framework in \(\mathbb{R}^n\). The planar, triangle-free unit-bar-framework given by the first author in 1991 was rigid, but not infinitesimally rigid; see Discrete Appl. Math. 31, No. 2, 193-200 (1991; Zbl 0762.05045). In this paper, the authors present a unit-bar-framework in 3-space which is infinitesimally rigid and triangle-free.
Graph theory, framework, Rigidity and flexibility of structures (aspects of discrete geometry), triangle-free, infinitesimally rigid
Graph theory, framework, Rigidity and flexibility of structures (aspects of discrete geometry), triangle-free, infinitesimally rigid
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
