%0 Journal Article
%A Bermudo Navarrete, Sergio
%T Upper bound for the geometric-arithmetic index of trees with given domination number
%D 2023
%U http://hdl.handle.net/10433/15148
%X Given 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.
%K Geometric-arithmetic index
%K Upper bound
%K Trees
%K Domination number
%~