Abstract
A rigidity theory is developed for countably infinite simple graphs in {mathbb {R}}^d. Generalisations are obtained for the Laman combinatorial characterisation of generic infinitesimal rigidity for finite graphs in {mathbb {R}}^2 and Tay’s multi-graph characterisation of generic infinitesimal rigidity for finite body-bar frameworks in {mathbb {R}}^d. Analogous results are obtained for the classical non-Euclidean ell ^q norms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
