On the Diminished Sombor Index of Fixed-Order Molecular Graphs With Cyclomatic Number at Least 3

Abstract

For a graph G with edge set E, let d(u) denote the degree of a vertex u in G. The diminished Sombor (DSO) index of G is defined as DSO(G)=Σuv∈ E(d(u))2+(d(v))2(d(u)+d(v))-1. 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 4 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 3, posed in the recent paper [F. Movahedi, I. Gutman, I. Redzepovi\'c, 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 n with cyclomatic number , provided that n 2(-1)4.

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…