Aug 2026· Match-communications in Mathematical and in Computer Chemistry· 0 citations
TL;DR
This work investigates the extremal structural properties of uniform hypertrees with respect to the Sombor index and the Sombor spectral radius, two degree-based measures that capture nonlinear connectivity patterns.
Abstract
In the framework of complex network analysis, hypergraphs provide a natural generalization for modeling higher-order interactions. In this work, we investigate the extremal structural properties of uniform hypertrees with respect to the Sombor index and the Sombor spectral radius, two degree-based measures that capture nonlinear connectivity patterns. For hypertrees of fixed size, we identify the structures that maximize and second-maximize these descriptors. We show that both the Sombor index and the Sombor spectral radius increase strictly under an edge-releasing operation applied to non-pendant hyperedges, revealing a monotonic structural transformation principle. This result enables us to characterize the hyperstar configuration as the unique maximizer of both measures. Furthermore, by systematically employing edge-moving and edge-releasing operations, we determine the hypertree structure that attains the second-highest values of these indices. Our findings contribute to the understanding of how local structural modifications influence global spectral and topological descriptors in higher-order networks, offering insights relevant to the study of nonlinear and complex systems.
This work generalizes three distance-based topological measures, namely closeness centrality, betweenness centrality and node eccentricity, using this new hypergraph distance, and shows that hypergraphs can be divided into three distinct classes, corresponding to the possible dominance of specific orders of interaction...
E. Vasil'yeva, L. Tupikina, D. Musatov et al.· Chaos, Solitons & Fracta...· 0 citations
The degree-ratio Sombor (DRSO) index is a recently introduced variant of the extensively studied Sombor index. In this paper, we establish an upper bound on the DRSO index in terms of the size, minimum degree, and maximum degree of a graph, which provides the unique graph maximizing the DRSO index among all fixed-order...
Akbar Ali, Ivan Gutman, Gasper George Nyauli et al.· Match-communications in Math...· 0 citations
The degree-ratio Sombor index (DRSO) is a recently introduced geometric degree-based topological invariant. First, we correct an erroneous lower bound involving the Sombor index and rectify the characterization of extremal graphs from the original work on this index [11]. Subsequently, we investigate the relationship b...
Zhou-Jian Shao, A. Jahanbani· Match-communications in Math...· 0 citations
The Sombor index has recently become a central tool among degree-based graph invariants; however, it does not explicitly isolate degree imbalance along edges. In this work, we introduce the degree-based Contrastive Sombor Index (CSO), which combines endpoint-degree magnitude with local degree imbalance. For a finite si...
Detecting structure in complex networks, especially those arising from physical systems, is a central problem across the sciences. One approach is via rich club analysis, which identifies important vertices using a centrality metric and measures whether those vertices are more tightly interconnected than expected by ch...
Jason P. Smith, Celia Hacker, J. Lazovskis et al.· 0 citations