Graph rigidity properties of Ramanujan graphs
Combinatorics
2024-01-18 v1
Abstract
A recent result of Cioab\u{a}, Dewar and Gu implies that any -regular Ramanujan graph with is globally rigid in . In this paper, we extend these results and prove that any -regular Ramanujan graph of sufficiently large order is globally rigid in when , and when if it is also vertex-transitive. These results imply that the Ramanujan graphs constructed by Morgenstern in 1994 are globally rigid. We also prove several results on other types of framework rigidity, including body-bar rigidity, body-hinge rigidity, and rigidity on surfaces of revolution. In addition, we use computational methods to determine which Ramanujan graphs of small order are globally rigid in .
Keywords
Cite
@article{arxiv.2206.03983,
title = {Graph rigidity properties of Ramanujan graphs},
author = {Sebastian M. Cioabă and Sean Dewar and Georg Grasegger and Xiaofeng Gu},
journal= {arXiv preprint arXiv:2206.03983},
year = {2024}
}
Comments
23 pages, 9 figures