Abstract
We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.
Funder
Agencia Estatal de Investigación
Madrid Government
Subject
General Physics and Astronomy
Reference41 articles.
1. Geometric approach to degree-based topological indices: Sombor indices;Gutman;MATCH Commun. Math. Comput. Chem.,2021
2. Computation of Sombor indices of certain networks;Kulli;SSRG Int. J. Appl. Chem.,2021
3. On the first Banhatti-Sombor index;Lina;arXiv,2021
4. On the Sombor index of graphs;Reti;Contrib. Math.,2021
5. The (a,b)-KA indices of polycyclic aromatic hydrocarbons and benzenoid systems;Kulli;Int. J. Math. Trends Technol.,2019
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献