For a graph with edge set , let denote the degree of a vertex in . The diminished Sombor (DSO) index of is defined as . The cyclomatic number of a graph is the smallest number of edges whose removal makes the graph acyclic. A connected graph of maximum degree at most is known as a molecular graph. The primary motivation of the present study comes from a conjecture concerning the minimum DSO index of fixed-order connected graphs with cyclomatic number , posed in the recent paper [F. Movahedi, I. Gutman, I. Redžepović, B. Furtula, Diminished Sombor index, MATCH Commun. Comput. Chem. 95 (2026) 141–162]. The present paper gives all graphs minimizing the DSO index among all molecular graphs of order with cyclomatic number , provided that .

生成讲解博客的中文版本

生成AI智能校验的中文版本