| Full text | |
| Author(s): |
Aguilar-Sanchez, R.
[1]
;
Mendez-Bermudez, J. A.
[2, 3]
;
Rodriguez, Jose M.
[4]
;
Sigarreta, Jose M.
[5]
Total Authors: 4
|
| Affiliation: | [1] Benemerita Univ Autonoma Puebla, Fac Ciencias Quim, Puebla 72570 - Mexico
[2] Benemerita Univ Autonoma Puebla, Inst Fis, Apartado Postal J-48, Puebla 72570 - Mexico
[3] Univ Sao Paulo, Inst Ciencias Matemat & Comp, Dept Matemat Aplicada & Estat, Campus Sao Carlos, Caixa Postal 668, BR-13560970 Sao Carlos, SP - Brazil
[4] Univ Carlos III Madrid, Dept Matemat, Ave Univ 30, Madrid 28911 - Spain
[5] Univ Autonoma Guerrero, Fac Matemat, Carlos E Adame 54 Col Garita, Acapulco Gro 39650 - Mexico
Total Affiliations: 5
|
| Document type: | Journal article |
| Source: | JOURNAL OF MATHEMATICAL CHEMISTRY; v. 59, n. 5 MAR 2021. |
| Web of Science Citations: | 0 |
| Abstract | |
In this work we perform analytical and statistical studies of the Rodriguez-Velazquez (RV) indices on graphs G. The topological RV(G) indices, recently introduced in Rodriguez-Velazquez and Balaban (J Math Chem 57:1053, 2019), are based on graph adjacency matrix eigenvalues and eigenvectors. First, we analytically obtain new relations connecting RV(G) with the graph energy E(G) and the subgraph centrality EE(G), the later being proportional to the well known Estrada index. Then, within a random matrix theory (RMT) approach we statistically validate our relations on ensembles of randomly-weighted Erdos-Renyi graphs G(n, p), characterized by n vertices connected independently with probability p is an element of (0, 1). Additionally, we show that the ratio < RV(G(n, p))>/< RV(G(n, 0))> scales with the average degree < k > = (n - 1)p. (AU) | |
| FAPESP's process: | 19/06931-2 - Random matrix theory approach to complex networks |
| Grantee: | Francisco Aparecido Rodrigues |
| Support Opportunities: | Research Grants - Visiting Researcher Grant - International |