On the conjecture about the exponential reduced Sombor index

Abstract

Let G=(V(G),E(G)) be a graph and d(v) be the degree of the vertex v∈ V(G). The exponential reduced Sombor index of G, denoted by eSOred(G), is defined as eSOred(G)=Σuv∈ E(G)e(d(u)-1)2+(d(v)-1)2. We obtain a characterization of extremal trees with the maximal exponential reduced Sombor index among all chemical trees of order n. This result shows the conjecture on the exponential reduced Sombor index proposed by Liu, You, Tang and Liu [On the reduced Sombor index and its applications, MATCH Commun. Math. Comput. Chem. 86 (2021) 729--753] is negative.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…