Lower Bounds for Zagreb Indices of RNA Graphs Using Graph Algorithms

Elif ERYAŞAR¹, Şerife BÜYÜKKÖSE²

1. Department of Mathematics, Sinop University, 57000, Sinop, Turkey.
2. Department of Mathematics, Gazi University, 06500, Ankara, Turkey (corresponding author).

Abstract: 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.

Keywords: Zagreb indices, Graph search algorithms, RNA graph representation, DFS and BFS trees of RNA.

Pages: 1 – 9 | Full PDF Paper