Lancaster EPrints (Lancaster University) · 2016 · 27 citations · 11 references
Open access
Natural SciencesComputer ScienceComputational GeometryStructural AnalysisTopologyConvex GeometryGeometric GraphsGraph TheoryMetric GeometryNon-euclidean GeometryRigidity Theory
The minimal innitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R2, ||.||q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally infinitesimally rigid with respect to a non-Euclidean lq norm if and only if the underlying graph G = (V,E) contains 2|V|-2 edges and every subgraph H = (V (H),E(H)) contains at most 2|V(H)|-2 edges.
11
On graphs and rigidity of plane skeletal structures
G. Laman · Journal of Engineering Mathematics · 1970 · 1.1K citations
Leonard Asimow, B. Roth · Journal of Mathematical Analysis and Applications · 1979 · 339 citations
Pebble game algorithms and sparse graphs
Audrey Lee, Ileana Streinu · Discrete Mathematics · 2007 · 223 citations