惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Blog — PlanetScale
Blog — PlanetScale
J
Java Code Geeks
月光博客
月光博客
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
Jina AI
Jina AI
小众软件
小众软件
U
Unit 42
云风的 BLOG
云风的 BLOG
Stack Overflow Blog
Stack Overflow Blog
雷峰网
雷峰网
博客园 - Franky
Microsoft Security Blog
Microsoft Security Blog
罗磊的独立博客
宝玉的分享
宝玉的分享
B
Blog
C
Check Point Blog
爱范儿
爱范儿
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
量子位
阮一峰的网络日志
阮一峰的网络日志
Vercel News
Vercel News
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Structural Properties and Applications of the Augmented S...
[Submitted on 25 Jun 2026] · 2026-06-26 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Topological indices are key quantitative descriptors in mathematical chemistry, unchanged under symmetry operations and retaining graph connectivity; they capture molecular structural features to provide insights into molecular stability and chemical properties, becoming indispensable in cheminformatics and theoretical chemistry. Among degree-based indices, the \textbf{Sombor index} is widely concerned for capturing structural information, and motivated by enhanced structural discrimination, the \textbf{augmented Sombor index} ($ASO$) is defined for a connected graph $\Omega$ with $|V(\Omega)|\geq 3$ as $$ASO(\Omega) = \sum_{v_iv_j\in E(\Omega)} \sqrt{\frac{d_i^2 + d_j^2}{d_i + d_j - 2}},$$ where $d_i$ and $d_j$ are the degrees of vertices $v_i$ and $v_j$, respectively. Within the scope of this study, we first establish several sharp bounds for the augmented Sombor index and characterize the extremal graphs attaining these bounds. In particular, we determine the minimum value of the $ASO$ index for unicyclic graphs with a prescribed girth and characterize all graphs achieving this minimum. We also identify the second maximum $ASO$ value among trees and characterize the corresponding extremal tree structures. Furthermore, the minimum and maximum values of the $ASO$ index for bipartite graphs and chemical graphs are obtained, together with a complete characterization of the associated extremal graphs. In addition, we characterize the chemical trees that maximize the $ASO$ index. The chemical applicability of the $ASO$ index is investigated through quantitative structure-property relationship (QSPR) analysis, supported by a comparative assessment of several variants of the Sombor index. Finally, we present concluding remarks and outline potential directions for future research on the augmented Sombor index of graphs.

Submission history

From: Jayanta Bera [view email]
[v1] Thu, 25 Jun 2026 01:30:03 UTC (419 KB)