English

Stolarsky-Puebla index

Combinatorics 2021-09-23 v1

Abstract

We introduce a degree-based variable topological index inspired on the Stolarsky mean (known as the generalization of the logarithmic mean). We name this new index as the Stolarsky-Puebla index: SPα(G)=uvE(G)duSP_\alpha(G) = \sum_{uv \in E(G)} d_u, if du=dvd_u=d_v, and SPα(G)=uvE(G)[(duαdvα)/(α(dudv)]1/(α1)SP_\alpha(G) = \sum_{uv \in E(G)} \left[\left( d_u^\alpha-d_v^\alpha\right)/\left( \alpha(d_u-d_v\right)\right]^{1/(\alpha-1)}, otherwise. Here, uvuv denotes the edge of the network GG connecting the vertices uu and vv, dud_u is the degree of the vertex uu, and αR\{0,1}\alpha \in \mathbb{R} \backslash \{0,1\}. Indeed, for given values of α\alpha, the Stolarsky-Puebla index reproduces well-known topological indices such as the reciprocal Randic index, the first Zagreb index, and several mean Sombor indices. Moreover, we apply these indices to random networks and demonstrate that <SPα(G)>\left< SP_\alpha(G) \right>, normalized to the order of the network, scale with the corresponding average degree <d>\left< d \right>.

Cite

@article{arxiv.2109.10464,
  title  = {Stolarsky-Puebla index},
  author = {J. A. Mendez-Bermudez and R. Aguilar-Sanchez and Ricardo Abreu Blaya and Jose M. Sigarreta},
  journal= {arXiv preprint arXiv:2109.10464},
  year   = {2021}
}

Comments

7 pages, 4 figures, accepted for publication in the special volume of Discrete Mathematics Letters on chemical graph theory in memory and honor of Professor Nenad Trinajsti\'c

R2 v1 2026-06-24T06:12:07.192Z