Skip to main navigation Skip to search Skip to main content

Infinitesimal rigidity in normed planes

  • Sean Dewar

Research output: Contribution to journal › Article (Academic Journal) › peer-review

8 Citations (Scopus)
38 Downloads (Pure)

Abstract

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and the geometric properties of the normed plane. As a key step, rigid placements are constructed for the complete graph $K_4$ by considering smoothness and strict convexity properties of the unit ball.
Original languageEnglish
Pages (from-to)1205 - 1231
Number of pages27
JournalSIAM Journal on Discrete Mathematics
Volume34
Issue number2
DOIs
Publication statusPublished - 26 May 2020

Bibliographical note

27 pages

Keywords

  • math.MG
  • 52C25, 52A21

Fingerprint

Dive into the research topics of 'Infinitesimal rigidity in normed planes'. Together they form a unique fingerprint.

Cite this