Lower Bounds for Zagreb Indices of RNA Graphs Using Graph Algorithms
Yazarlar (2)
Prof. Dr. Şerife Büyükköse Gazi Üniversitesi, Türkiye
Arş. Gör. Elif ERYAŞAR Sinop Üniversitesi, Türkiye
| Makale Türü |
Özgün Makale
(Diğer hakemli uluslarası dergilerde yayınlanan tam makale)
|
||
| Dergi Adı | Journal of Mathematics and Statistical Science | ||
| Dergi ISSN | 2411-2518 | ||
| Dergi Tarandığı Indeksler | Google Scholar | ||
| Makale Dili | Türkçe | Basım Tarihi | 01-2023 |
| Cilt / Sayı / Sayfa | – / 1 / – | DOI | – |
| Makale Linki | http://www.ss-pub.org/wp-content/uploads/2023/03/JMSS2022110101.pdf | ||
| UAK Araştırma Alanları |
Cebir ve Sayılar Teorisi
|
||
| Özet |
| The structure of RNA has been a natural subject for mathematical modeling, including many innovative computational models. The representation of RNA secondary structures as mathematical graphs has been illuminating for RNA structure analysis. In this work, we introduce the first and second Zagreb indices. Then, we obtain tree structures through BFS and DFS algorithms from graph searching algorithms. With the help of these trees, we compare these lower bound values by giving lower bounds for the first and second Zagreb indices of RNA secondary structure graphs. |
| Anahtar Kelimeler |
