paper

Maximum Diminished Sombor Index of Molecular Trees with a Perfect Matching

arXiv:2512.19710

Abstract

The diminished Sombor index of a graph , introduced by Rajathagiri, is defined as where and are the degrees of vertices and . A graph is a molecular graph if for all . In this paper, we examine the chemical applicability of the 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 with perfect matching and characterize all the corresponding extremal trees.