Let
ξ
be a simple connected graph. The first Gourava index of graph
ξ
is defined as
G
O
1
ξ
=
∑
μ
η
∈
E
ξ
d
μ
+
d
η
+
d
μ
d
η
, where
d
μ
indicates the degree of vertex
μ
. In this paper, we will find the upper bound of
G
O
1
ξ
for trees of given diameter, order, size, and pendent nodes, by using some graph transformations. We will find the extremal trees and also present an ordering of these trees having this index in decreasing order.