Bermudo Navarrete, Sergio2022-11-222022-11-222023Discrete Mathematics, Volume 346, Issue 1, 2023, 11317210.1016/j.disc.2022.113172http://hdl.handle.net/10433/15148Given a graph G with vertex set and edge set , the geometric-arithmetic index is the value where and denote the degrees of the vertices , respectively. In this work we present an upper bound for the geometric-arithmetic index of trees in terms of the order and the domination number, and we characterize the extremal trees for this upper bound. Finally, using a known relation between the geometric-arithmetic and arithmetic-geometric indices, we deduce a lower bound for the arithmetic-geometric index using the same parameters.application/pdfenGeometric-arithmetic indexUpper boundTreesDomination numberjournal articleopen access