A necessary condition for generic rigidity of bar‐and‐joint frameworks in d‐space
Yazarlar (2)
Dr. Öğr. Üyesi Hakan GÜLER Kastamonu Üniversitesi, Türkiye
Bill Jackson
Queen Mary University Of London, İngiltere
Queen Mary University Of London, İ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 | 09-2022 |
| Kabul Tarihi | 25-08-2021 | Yayınlanma Tarihi | 08-09-2021 |
| Cilt / Sayı / Sayfa | 99 / 2 / 231–239 | DOI | 10.1002/jgt.22737 |
| Makale Linki | http://dx.doi.org/10.1002/jgt.22737 | ||
| Özet |
| A graph is ‐sparse if each subset with induces at most d ∣ X ∣ − d + 1 2 edges in . Maxwell showed in 1864 that a necessary condition for a generic bar‐and‐joint framework with at least vertices to be rigid in is that should have a ‐sparse subgraph with d ∣ X ∣ − d + 1 2 edges. This necessary condition is also sufficient when but not when . Cheng and Sitharam strengthened Maxwell's condition by showing that every maximal ‐sparse subgraph of should have d ∣ X ∣ − d + 1 2 edges when . We extend their result to all . |
| Anahtar Kelimeler |
| bar–joint framework | infinitesimal rigidity | rigidity matroid |
BM Sürdürülebilir Kalkınma Amaçları
| Atıf Sayıları | |
| Web of Science | 2 |
| Scopus | 2 |
| Google Scholar | 7 |