Multiplicative topological indices: Analytical properties and application to random networks

Abstract

We consider two general classes of multiplicative degree-based topological indices (MTIs), denoted by $ X_{\Pi, F_V}(G) = \prod_{u \in V(G)} F_V(d_u) $ and $ X_{\Pi, F_E}(G) = \prod_{uv \in E(G)} F_E(d_u, d_v) $, where $ uv $ indicates the edge of $ G $ connecting the vertices $ u $ and $ v $, $ d_u $ is the degree of the vertex $ u $, and $ F_V(x) $ and $ F_E(x, y) $ are functions of the vertex degrees. This work has three objectives: First, we follow an analytical approach to deal with a classical topic in the study of topological indices: to find inequalities that relate two MTIs between them, but also to their additive versions $ X_\Sigma(G) $. Second, we propose some statistical analysis of MTIs as a generic tool for studying average properties of random networks, extending these techniques for the first time to the context of MTIs. Finally, we perform an innovative scaling analysis of MTIs which allows us to state a scaling law that relates different random graph models.

Keywords

• multiplicative topological index
• degree-based topological index
• random graphs