English

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

Combinatorics 2025-09-17 v1

Abstract

For a graph GG with edge set EE, let d(u)d(u) denote the degree of a vertex uu in GG. The diminished Sombor (DSO) index of GG is defined as DSO(G)=uvE(d(u))2+(d(v))2(d(u)+d(v))1DSO(G)=\sum_{uv\in E}\sqrt{(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 44 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 33, posed in the recent paper [F. Movahedi, I. Gutman, I. Red\v{z}epovi\'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 nn with cyclomatic number \ell, provided that n2(1)4n\ge 2(\ell-1)\ge4.

Keywords

Cite

@article{arxiv.2509.12294,
  title  = {On the Diminished Sombor Index of Fixed-Order Molecular Graphs With Cyclomatic Number at Least 3},
  author = {Abdulaziz Mutlaq Alotaibi and Abdulaziz M. Alanazi and Taher S. Hassan and Akbar Ali},
  journal= {arXiv preprint arXiv:2509.12294},
  year   = {2025}
}

Comments

15 pages, 2 figures