Maximum Diminished Sombor Index of Molecular Trees with a Perfect Matching

Abstract

The diminished Sombor index (DSO) of a graph G, introduced by Rajathagiri, is defined as DSO(G)=Σuv∈ Edu2+dv2du+dv, where du and dv are the degrees of vertices u and v. A graph G is a molecular graph if dG(u)≤ 4 for all u∈ V(G). In this paper, we examine the chemical applicability of the DSO index for predicting physicochemical properties of octane isomers. We also determine the maximum value of the diminished Sombor index among all molecular trees of order n with perfect matching and characterize all the corresponding extremal trees.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…