The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful. The aim of this paper is to obtain new upper bounds of the geometric-arithmetic index and characterize graphs extremal with respect to them.