Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Gutman et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: