Spectral radius conditions for the rigidity of graphs
From MaRDI portal
Publication:6046220
DOI10.37236/11308zbMath1514.05096OpenAlexW4366771178MaRDI QIDQ6046220
Dandan Fan, Huiqiu Lin, Xueyi Huang
Publication date: 16 May 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/11308
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- A sufficient connectivity condition for generic rigidity in the plane
- Connected rigidity matroids and unique realizations of graphs
- A sharp upper bound of the spectral radius of graphs
- Spectral conditions for graph rigidity in the Euclidean plane
- Generic global rigidity
- Every 3-connected, essentially 11-connected line graph is Hamiltonian
- On graphs and rigidity of plane skeletal structures
- Eigenvector synchronization, graph rigidity and the molecule problem
- Some Inequalities for the Largest Eigenvalue of a Graph
- The 2-dimensional rigidity of certain families of 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
- Sufficient Conditions for 2-Dimensional Global Rigidity
This page was built for publication: Spectral radius conditions for the rigidity of graphs
