相关论文: Characterizing Generic Global Rigidity

A (bar-and-joint) framework is a set of points in a normed space with a set of fixed distance constraints between them. Determining whether a framework is locally rigid - i.e. whether every other suitably close framework with the same…

We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present…

The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…

A recent result of Cioab\u{a}, Dewar and Gu implies that any $k$-regular Ramanujan graph with $k\geq 8$ is globally rigid in $\mathbb{R}^2$. In this paper, we extend these results and prove that any $k$-regular Ramanujan graph of…

Belk and Connelly introduced the realizable dimension $\textrm{rd}(G)$ of a finite graph $G$, which is the minimum nonnegative integer $d$ such that every framework $(G,p)$ in any dimension admits a framework in $\mathbb{R}^d$ with the same…

Let $\mathbf{p}$ be a configuration of $n$ points in $\mathbb{R}^d$ for some $n$ and some $d \ge 2$. Each pair of points has a Euclidean length in the configuration. Given some graph $G$ on $n$ vertices, we measure the point-pair lengths…

We consider the problem of characterising the generic rigidity of bar-joint frameworks in $\mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu…

A bar-joint framework $(G,p)$ in a (non-Euclidean) real normed plane $X$ is the combination of a finite, simple graph $G$ and a placement $p$ of the vertices in $X$. A framework $(G,p)$ is globally rigid in $X$ if every other framework…

The 2-dimensional global rigidity has been shown to be equivalent to 3-connectedness and redundant rigidity by a combination of two results due to Jackson and Jord\'an, and Connelly, respectively. By the characterization, a theorem of…

A bar-joint framework $(G,p)$ is the combination of a graph $G$ and a map $p$ assigning positions, in some space, to the vertices of $G$. The framework is rigid if every edge-length-preserving continuous motion of the vertices arises from…

A configuration p in r-dimensional Euclidean space is a finite collection of labeled points p^1,p^2,...,p^n in R^r that affinely span R^r. Each configuration p defines a Euclidean distance matrix D_p = (d_ij) = (||p^i-p^j||^2), where ||.||…

We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…

The $d$-dimensional algebraic connectivity $a_d(G)$ of a graph $G=(V,E)$, introduced by Jord\'an and Tanigawa, is a quantitative measure of the $d$-dimensional rigidity of $G$ that is defined in terms of the eigenvalues of stiffness…

A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…

In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

We give a necessary condition of generic 3 -rigidity of graphs relying on partitioning the edges into 3 subsets; such that each subset-pair gives a generically 2-rigid graph, either by themselves or after an appropriate edge-deletion.…

A vertex-transitive graph X is called local-to-global rigid if there exists R such that every other graph whose balls of radius R are isometric to the balls of radius R in X is covered by X. Let $d\geq 4$. We show that the 1-skeleton of an…