Flexible circuits in the d‐dimensional rigidity matroid
Yazarlar (4)
Georg Grasegger
Johann Radon Institute For Computational And Applied Mathematics, Avusturya
Johann Radon Institute For Computational And Applied Mathematics, Avusturya
Dr. Öğr. Üyesi Hakan GÜLER Kastamonu Üniversitesi, Türkiye
Bill Jackson
Queen Mary University Of London, İngiltere
Queen Mary University Of London, İngiltere
Anthony Nixon
Department Of Mathematics And Statistics, Lancaster University, İngiltere
Department Of Mathematics And Statistics, Lancaster University, İngiltere
| Makale Türü | Özgün Makale (SSCI, AHCI, SCI, SCI-Exp dergilerinde yayınlanan tam makale) | ||
| Dergi Adı | Journal of Graph Theory (Q3) | ||
| Dergi ISSN | 0364-9024 Wos Dergi Scopus Dergi | ||
| Dergi Tarandığı Indeksler | SCI-Expanded | ||
| Makale Dili | İngilizce | Basım Tarihi | 12-2022 |
| Kabul Tarihi | 15-11-2021 | Yayınlanma Tarihi | 06-12-2021 |
| Cilt / Sayı / Sayfa | 100 / 2 / 315–330 | DOI | 10.1002/jgt.22780 |
| Makale Linki | http://dx.doi.org/10.1002/jgt.22780 | ||
| Özet |
| A bar‐joint framework in is rigid if the only edge‐length preserving continuous motions of the vertices arise from isometries of . It is known that, when is generic, its rigidity depends only on the underlying graph , and is determined by the rank of the edge set of in the generic ‐dimensional rigidity matroid . Complete combinatorial descriptions of the rank function of this matroid are known when , and imply that all circuits in are generically rigid in when . Determining the rank function of is a long standing open problem when , and the existence of nonrigid circuits in for is a major contributing factor to why this problem is so difficult. We begin a study of nonrigid circuits by characterising the nonrigid circuits in which have at most vertices. |
| Anahtar Kelimeler |
| bar-joint framework | flexible circuit | rigid graph | rigidity matroid |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 6 |
| Scopus | 5 |
| Google Scholar | 20 |