Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 15 Sep 2025 in math.CO | (2509.12294v1)

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)=\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 $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 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 $n$ with cyclomatic number $\ell$, provided that $n\ge 2(\ell-1)\ge4$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.