Graph rigidity properties of Ramanujan graphs
Summary: A recent result of \textit{S. M. Cioabă} et al. [Discrete Math. 344, No. 10, Article ID 112527, 9 p. (2021; Zbl 1469.05102)] implies that any \(k\)-regular Ramanujan graph with \(k \geqslant 8\) is globally rigid in \(\mathbb{R}^2\). In this paper, we extend these results and prove that any \(k\)-regular Ramanujan graph of sufficiently large order is globally rigid in \(\mathbb{R}^2\) when \(k\in \{6, 7\} \), and when \(k\in \{4,5\}\) if it is also vertex-transitive. These results imply that the Ramanujan graphs constructed by \textit{M. Morgenstern} in [J. Comb. Theory, Ser. B 62, No. 1, 44--62 (1994; Zbl 0814.68098)] 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 \(\mathbb{R}^2\).
- A census of small transitive groups and vertex-transitive graphs
- A characterization of generically rigid frameworks on surfaces of revolution
- A sufficient connectivity condition for generic rigidity in the plane
- Characterizing generic global rigidity
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Connectivity and edge-disjoint spanning trees
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Edge-disjoint spanning trees and eigenvalues
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
- Eigenvalues and edge-connectivity of regular graphs
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit construction of linear sized tolerant networks
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Fractional spanning tree packing, forest covering and eigenvalues
- Generic global rigidity
- Generic global rigidity of body-hinge frameworks
- Global rigidity of generic frameworks on the cylinder
- scientific article; zbMATH DE number 3859878 (Why is no real title available?)
- scientific article; zbMATH DE number 17636 (Why is no real title available?)
- scientific article; zbMATH DE number 36698 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- scientific article; zbMATH DE number 1911992 (Why is no real title available?)
- scientific article; zbMATH DE number 3432305 (Why is no real title available?)
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Large incidence-free sets in geometries
- Large matchings from eigenvalues
- Matchings in regular graphs from eigenvalues
- Note on edge-disjoint spanning trees and eigenvalues
- On Generic Rigidity in the Plane
- On graphs and rigidity of plane skeletal structures
- On Moore Graphs with Diameters 2 and 3
- On the Problem of Decomposing a Graph into n Connected Factors
- On the second eigenvalue of a graph
- Optimal attack and reinforcement of a network
- Pseudo-random graphs
- Ramanujan graphs
- Rigidity of Frameworks Supported on Surfaces
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
- Spectral conditions for edge connectivity and packing spanning trees in multigraphs
- Spectral conditions for graph rigidity in the Euclidean plane
- The 2-dimensional rigidity of certain families of graphs
- The generic rank of body-bar-and-hinge frameworks
- The Rigidity of Graphs
This page was built for publication: Graph rigidity properties of Ramanujan graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133153)