Now showing items 1-1 of 1

    • Which graphs are rigid in lpd? (Pre-published) 

      Dewar, Sean; Kitson, Derek; Nixon, Anthony (Springer, 2021-03-13)
      We present three results which support the conjecture that a graph is minimally rigid in d-dimensional ℓp-space, where p∈(1,∞) and p≠2, if and only if it is (d, d)-tight. Firstly, we introduce a graph bracing operation ...