This is the authors' abstract. We don't add key points for this paper.
Rigidity is the property of a structure that does not flex under an applied force. In the past several decades, the rigidity of graphs has been widely studied in discrete geometry and combinatorics. Laman (1970) obtained a combinatorial characterization of rigid graphs in R². Lovász and Yemini (1982) proved that every $6$-connected graph is rigid in R². Jackson and Jordán (2005) strengthened this result, and showed that every $6$-connected graph is globally rigid in R². Thus every graph with algebraic connectivity greater than $5$ is globally rigid in R². In 2021, Cioabă, Dewar and Gu improved this bound, and proved that every graph with minimum degree at least $6$ and algebraic connectivity greater than 2+1/δ-1 (resp., 2+2/δ-1) is rigid (resp., globally rigid) in R². In this paper, we study the rigidity of graphs in R² from the viewpoint of adjacency eigenvalues. Specifically, we provide a spectral radius condition for the rigidity (resp., globally rigidity) of $2$-connected (resp., $3$-connected) graphs with given minimum degree. Furthermore, we determine the unique graph attaining the maximum spectral radius among all minimally rigid graphs of order n.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Fan et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: