Multiplicative topological indices: Analytical properties and application to random networks
arXiv:2306.02511
Abstract
We make use of multiplicative degree-based topological indices to perform a detailed analytical and statistical study of random networks . We consider two classes of indices: and , where denotes the edge of connecting the vertices and , is the degree of the vertex , and and are functions of the vertex degrees. Specifically, we find analytical inequalities involving these multiplicative indices. Also, we apply on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. We show that , normalized to the order of the network, scale with the corresponding average degree; here denotes the average over an ensemble of random networks.
19 pages, 7 figures