| Makale Türü |
|
||
| Dergi Adı | Graphs and Combinatorics (Q4) | ||
| Dergi ISSN | 0911-0119 Wos Dergi Scopus Dergi | ||
| Dergi Tarandığı Indeksler | SCI-Expanded | ||
| Makale Dili | Türkçe | Basım Tarihi | 07-2022 |
| Kabul Tarihi | 18-07-2022 | Yayınlanma Tarihi | 30-07-2022 |
| Cilt / Sayı / Sayfa | 38 / 4 / 128–0 | DOI | 10.1007/s00373-022-02540-9 |
| Makale Linki | http://dx.doi.org/10.1007/s00373-022-02540-9 | ||
| Özet |
| Fekete, Jordán and Kaszanitzky (Graphs Combin 31:585–599, 2015) characterised the graphs which can be realised as 2-dimensional, infinitesimally rigid, bar-joint frameworks in which two given vertices are coincident. We formulate a conjecture which would extend their characterisation to an arbitrary set T of vertices and verify our conjecture when . |
| Anahtar Kelimeler |
| Coincident points | Count matroid | Infinitesimal rigidity |
| Atıf Sayıları | |
| Web of Science | 2 |
| Scopus | 2 |
| Google Scholar | 2 |
| Dergi Adı | GRAPHS AND COMBINATORICS |
| Yayıncı | Springer Japan |
| Açık Erişim | Hayır |
| ISSN | 0911-0119 |
| E-ISSN | 1435-5914 |
| CiteScore | 1,2 |
| SJR | 0,658 |
| SNIP | 0,902 |