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

推荐订阅源

钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园_首页
Engineering at Meta
Engineering at Meta
量子位
A
About on SuperTechFans
阮一峰的网络日志
阮一峰的网络日志
Recent Announcements
Recent Announcements
博客园 - 司徒正美
V
Visual Studio Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
The GitHub Blog
The GitHub Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
腾讯CDC
Jina AI
Jina AI
C
Check Point Blog
H
Help Net Security
罗磊的独立博客
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
V2EX
爱范儿
爱范儿
I
InfoQ

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Structural Properties and Applications of the Augmented S...
[Submitted on 25 Jun 2026] · 2026-06-26 · via math 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)