Cargando…
Which graphs are rigid in [Formula: see text] ?
We present three results which support the conjecture that a graph is minimally rigid in d-dimensional [Formula: see text] -space, where [Formula: see text] and [Formula: see text] , if and only if it is (d, d)-tight. Firstly, we introduce a graph bracing operation which preserves independence in th...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9033754/ https://www.ncbi.nlm.nih.gov/pubmed/35528137 http://dx.doi.org/10.1007/s10898-021-01008-z |