Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2602.15086

M-polynomial Based Mathematical Formulation of the Hyperbolic Sombor Index

Jayjit Barman·Shibsankar Das
View original source ↗Read source document ↗Export metadata ↓

Abstract

The numerical values extracted from a graph that indicates its topology are called topological indices. A contemporary and efficient method is to compute a graph's topological indices using the graph polynomial that corresponds to it. This method of identifying degree-based topological indices involves the use of the M-polynomial. Very recently, in 2025, the hyperbolic Sombor index (HSO) was proposed and shows its chemical applicability for octane isomers and the structure sensitivity and abruptness for octane, nonane, and decane isomers, respectively. In this work, we establish the closed derivation formula for the above-mentioned index of a graph based on its M-polynomial. Additionally, we use our proposed derivation formula to calculate the hyperbolic Sombor index of a few standard graphs and chemical families. Moreover, we provide the numerical and graphical representations for the M-polynomial and the computed HSO index of the chemical families.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jayjit Barman, Shibsankar Das. 2026-02-16. M-polynomial Based Mathematical Formulation of the Hyperbolic Sombor Index. https://arxiv.org/abs/2602.15086

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM↗
arXiv2026

Three Hardness Results for Graph Similarity Problems

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance $δ_{\mathcal{E}}$, and the metrics arising from $\ell_p$-operator norms, which we denote by $δ_p$ and $δ_{|p|}$. We address the following question: can these measures of similarity be used to design polynomial-time approximation algorithms for graph isomorphism? We show that computing an optimal value of $δ_{\mathcal{E}}$ is \NP-hard on pairs of graphs with the same number of edges. In addition, we show that computing optimal values of $δ_p$ and $δ_{|p|}$ is \NP-hard even on pairs of $1$-planar graphs with the same degree sequence and bounded degree. These two results improve on previous known ones, which did not examine the restricted case where the pairs of graphs are required to have the same number of edges. Finally, we study similarity problems on strongly regular graphs and prove some near optimal inequalities with interesting consequences on the computational complexity of graph and group isomorphism.

cs.DM↗