Degree heterogeneity of graphs and networks. II. Comparison with other indices

References

• H. Abdo, N. Cohen and D. Dimitrov, Graphs with maximal irregularity, Filomat, 28 (2014), pp. 1315-1322. doi: 10.2298/FIL1407315A
   Web of Science ®Google Scholar
• M. O. Albertson, The irregularity of a graph, Ars Combinatoria, 46 (1997), pp. 219-225.
   Web of Science ®Google Scholar
• A. Arenas, A. Díaz-Guilera and R. Guimerà, Communication in networks with hierarchical branching, Phys. Rev. Lett. 86 (2001) p. 3196. doi: 10.1103/PhysRevLett.86.3196
   PubMed Web of Science ®Google Scholar
• F. K. Bell, A note on the irregularity of graphs, Lin. Algebra Appl., 161 (1992), pp. 45-54. doi: 10.1016/0024-3795(92)90004-T
   Web of Science ®Google Scholar
• A.E. Brouwer and W.H. Haemers, Spectra of Graphs, Springer Science & Business Media, New York, 2011.
   Google Scholar
• L. Von Collatz and U. Sinogowitz, Spektren endlicher grafen. Abhand-lungen aus dem Mathematischen Seminar der Universität Hamburg, 21 (1957), pp. 63-77. doi: 10.1007/BF02941924
   Google Scholar
• D. Cvetković, S. Simić and P. Rowlinson, An Introduction to the Theory of Graph Spectra, Cambridge University Press, Cambridge, 2009.
   Google Scholar
• E. Estrada, Degree heterogeneity of graphs and networks. I. Interpretation and the “heterogeneity paradox”. Journal of Interdisciplinary Mathematics 22 (2019), 503-529. doi: 10.1080/09720502.2019.1643553
   Web of Science ®Google Scholar
• E. Estrada, The Structure of Complex Networks. Theory and Applications, Oxford University Press, Oxford, 2011.
   Google Scholar
• E. Estrada, Quantifying network heterogeneity. Phys. Rev. E., 82 (2010), p. 066102. doi: 10.1103/PhysRevE.82.066102
   Web of Science ®Google Scholar
• E. Estrada, Characterization of 3D molecular structure, Chem. Phys. Lett., 319 (2000), pp. 713–718. doi: 10.1016/S0009-2614(00)00158-5
   Web of Science ®Google Scholar
• E. Estrada, The communicability distance in graphs, Lin. Algebra Appl., 436 (2012), pp. 4317-4328. doi: 10.1016/j.laa.2012.01.017
   Web of Science ®Google Scholar
• E. Estrada and N. Hatano, Communicability angle and the spatial efficiency of networks, SIAM Rev., 58 (2016), pp. 692-715. doi: 10.1137/141000555
   Web of Science ®Google Scholar
• E. Estrada, M. G. Sanchez-Lirola and J. A. De La Peña, Hyperspherical embedding of graphs and networks in communicability spaces, Discr. Appl. Math., 176 (2014), pp. 53-77. doi: 10.1016/j.dam.2013.05.032
   Web of Science ®Google Scholar
• J. A. de la Peña, I. Gutman and J. Rada, Estimating the Estrada index. Lin. Algebra Appl., 427 (2007), pp. 70-76. doi: 10.1016/j.laa.2007.06.020
   Web of Science ®Google Scholar
• M. Fiedler, Algebraic connectivity of graphs. Czech. Math. J., 23 (1973), pp. 298-305.
   Google Scholar
• L. C. Freeman, A set of measures of centrality based on betweenness. Sociometry, 1 (1977), pp. 35-41. doi: 10.2307/3033543
   Google Scholar
• I. Gutman and N. Trinajstić, Graph theory and molecular orbitals. Total f-electron energy of alternant hydrocarbons. Chem. Phys. Lett., 17 (1972), pp. 535-538. doi: 10.1016/0009-2614(72)85099-1
   Web of Science ®Google Scholar
• R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1990.
   Google Scholar
• D. X. Horváth and J. Kertész, Spreading dynamics on networks: the role of burstiness, topology and non-stationarity. New J. Phys., 16 (2014), p. 073037. doi: 10.1088/1367-2630/16/7/073037
   Web of Science ®Google Scholar
• O. Ivanciuc, T. S. Balaban and A. T. Balaban, Design of topological indices. Part 4. Reciprocal distance matrix, related local vertex invariants and topological indices. J. Math. Chem., 12 (1993), pp. 309-318. doi: 10.1007/BF01164642
   Web of Science ®Google Scholar
• D. J. Klein and M. Randić, Resistance distance. J. Math. Chem., 12 (1993), pp. 81-95. doi: 10.1007/BF01164627
   Web of Science ®Google Scholar
• V. Latora and M. Marchiori, Efficient behavior of small-world networks. Phys. Rev. Lett., 87 (2001), p. 198701. doi: 10.1103/PhysRevLett.87.198701
   PubMed Web of Science ®Google Scholar
• X. Li and Y. Shi, A survey on the Randic index. MATCH Commun. Math. Comput. Chem., 59 (2008), pp. 127-156.
   Web of Science ®Google Scholar
• Y. Y. Liu, J. J. Slotine and A.-L. Barabási, Controllability of complex networks. Nature, 473 (2011), pp. 167-173. doi: 10.1038/nature10011
   PubMed Web of Science ®Google Scholar
• M. E. Newman, Assortative mixing in networks. Phys. Rev. Lett., 89 (2002), p. 208701. doi: 10.1103/PhysRevLett.89.208701
   PubMed Web of Science ®Google Scholar
• V. Nikiforov, Eigenvalues and degree deviation in graphs. Lin. Algebra Appl., 414 (2006), pp. 347-360. doi: 10.1016/j.laa.2005.10.011
   Web of Science ®Google Scholar
• D. Plavšić, S. Nikolić, N. Trinajstić and Z. Mihalić, On the Harary index for the characterization of chemical graphs. J. Math. Chem., 12 (1993), pp. 235-250. doi: 10.1007/BF01164638
   Web of Science ®Google Scholar
• M. Randić, Characterization of molecular branching. J. Am. Chem. Soc., 97 (1975), pp. 6609-6615. doi: 10.1021/ja00856a001
   Web of Science ®Google Scholar
• M. R. Shaeban, R. Jose, C. San, and L. Santen, Unraveling the structure of treelike networks from first-passage times of lazy random walkers. Phys. Rev. E, 98 (2018), p. 042315.
   Google Scholar
• A. Singh and S. Jalan, Delay-induced cluster patterns in coupled Cayley tree networks. Eur. Phys. J. Spec. Top., 222 (2013), pp. 885-893. doi: 10.1140/epjst/e2013-01891-2
   Web of Science ®Google Scholar
• T. A. Snijders, The degree variance: an index of graph heterogeneity. Social Nets., 3 (1981), pp. 163-174. doi: 10.1016/0378-8733(81)90014-9
   Web of Science ®Google Scholar
• D. J. Watts and S. H. Strogatz, Collective dynamics of ‘small-world’ networks. Nature, 393 (1998), pp. 440-442. doi: 10.1038/30918
   PubMed Web of Science ®Google Scholar
• H. Wiener, Structural determination of paraffin boiling points. J. Am. Chem. Soc., 69 (1947), pp. 17-20. doi: 10.1021/ja01193a005
   PubMed Web of Science ®Google Scholar
• L. Zhao, Y. C. Lai, K. Park and N. Ye, Onset of traffic congestion in complex networks. Phys. Rev. E, 71 (2005), p. 026125.
   Google Scholar