The paper is concerned with the recently introduced vertex-degree-based graph invariant called Gourava Sombor index (GSO). Lower and upper bounds for GSO are obtained, in terms of Gourava index and the two Zagreb indices. For any graph, the upper bound is strict. Its improvements for special types of graphs are established.