Two problems on the Sombor indices of molecular graphs

preprint OA: closed
View at publisher

Abstract

Gutman proposed a new alternative interpretation of vertex-degree-based topological index, called Sombor index. It is defined via the term $\sqrt{d_G(v_i)^2+d_G(v_j)^2}$, where d G ( v i ) is the degree of the vertex v i in graph G . Deng et al. [Int. J. Quantum Chem. 121(11) (2021), e26622] proposed the following two problems: to determine the maximum value of the (reduced) Sombor index among all molecular graphs of order n and to determine the extremal (minimum and maximum) of the (reduced) Sombor index among all connected graphs with n vertices and m edges. In this paper, we solve these two problems. Keywords: Degree; Sombor index; Molecular tree AMS subject classification 2010: 05C05, 05C12, 05C35

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-13T06:42:57.164913+00:00