| Yazarlar |
Dr. Öğr. Üyesi Hakan GÜLER
Kastamonu Üniversitesi, Türkiye |
|
Bill Jackson
|
| Özet |
| A graph (Formula presented.) is (Formula presented.) -sparse if each subset (Formula presented.) with (Formula presented.) induces at most (Formula presented.) edges in (Formula presented.). Maxwell showed in 1864 that a necessary condition for a generic bar-and-joint framework with at least (Formula presented.) vertices to be rigid in (Formula presented.) is that (Formula presented.) should have a (Formula presented.) -sparse subgraph with (Formula presented.) edges. This necessary condition is also sufficient when (Formula presented.) but not when (Formula presented.). Cheng and Sitharam strengthened Maxwell's condition by showing that every maximal (Formula presented.) -sparse subgraph of (Formula presented.) should have (Formula presented.) edges when (Formula presented.). We extend their result to all (Formula presented.). |
| Anahtar Kelimeler |
| bar–joint framework | infinitesimal rigidity | rigidity matroid |
| Makale Türü | Özgün Makale |
| Makale Alt Türü | SSCI, AHCI, SCI, SCI-Exp dergilerinde yayımlanan tam makale |
| Dergi Adı | JOURNAL OF GRAPH THEORY |
| Dergi ISSN | 0364-9024 |
| Dergi Tarandığı Indeksler | SCI-Expanded |
| Dergi Grubu | Q3 |
| Makale Dili | İngilizce |
| Basım Tarihi | 02-2022 |
| Cilt No | 99 |
| Sayı | 2 |
| Sayfalar | 231 / 239 |
| Doi Numarası | 10.1002/jgt.22737 |
| Makale Linki | http://dx.doi.org/10.1002/jgt.22737 |
| Atıf Sayıları | |
| WoS | 2 |
| SCOPUS | 2 |
| Google Scholar | 6 |
