Spectral conditions for graph rigidity in the Euclidean plane
From MaRDI portal
Publication:2043397
DOI10.1016/j.disc.2021.112527zbMath1469.05102arXiv2001.06934WikidataQ114190605 ScholiaQ114190605MaRDI QIDQ2043397
Xiaofeng Gu, Sean Dewar, Sebastian M. Cioabă
Publication date: 2 August 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.06934
05C10: Planar graphs; geometric and topological aspects of graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
52C25: Rigidity and flexibility of structures (aspects of discrete geometry)
05C40: Connectivity
Related Items
Spectral radius conditions for the rigidity of graphs, Spectral radius and edge‐disjoint spanning trees, Graph rigidity properties of Ramanujan graphs, Extremal graphs for a spectral inequality on edge-disjoint spanning trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional spanning tree packing, forest covering and eigenvalues
- Packing of rigid spanning subgraphs and spanning trees
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- A sufficient connectivity condition for generic rigidity in the plane
- Connected rigidity matroids and unique realizations of graphs
- Extremal graphs for a spectral inequality on edge-disjoint spanning trees
- Toughness in pseudo-random graphs
- Note on edge-disjoint spanning trees and eigenvalues
- Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs
- Generic global rigidity
- On graphs and rigidity of plane skeletal structures
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Eigenvector synchronization, graph rigidity and the molecule problem
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Characterizing generic global rigidity
- On Generic Rigidity in the Plane
- Conditions for Unique Graph Realizations
- The Rigidity of Graphs
- Spanning Rigid Subgraph Packing and Sparse Subgraph Covering