References
- R. Albert and A.L. Barabási, Statistical mechanics of complex networks, Rev. Modern Phys. 74 (2002), pp. 47–97. doi: 10.1103/RevModPhys.74.47
- M.O. Albertson, The irregularity of a graph, Ars Combin. 46 (1997), pp. 219–225.
- Y. Bar-Yam, Dynamics of Complex Systems, Addison-Wesley, Reading, MA, 1997.
- F.K. Bell, A note on the irregularity of graphs, Linear Algebra Appl. 161 (1992), pp. 45–54. doi: 10.1016/0024-3795(92)90004-T
- S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D.-U. Hwang, Complex networks: Structure and dynamics, Phys. Rep. 424 (2006), pp. 175–308. doi: 10.1016/j.physrep.2005.10.009
- P. Bonacich, Factoring and weighing approaches to status scores and clique information, J. Math. Soc. 2 (1972), pp. 113–120. doi: 10.1080/0022250X.1972.9989806
- P. Bonacich and P. Lloyd, Eigenvectors-like measures of centrality for asymmetric relations, Soc. Netw. 23 (2001), pp. 191–201. doi: 10.1016/S0378-8733(01)00038-7
- L. Collatz and U. Sinogowitz, Spektren endlicher Graphen, Abh. Math. Sem. Univ. Hamburg 21 (1957), pp. 63–77. doi: 10.1007/BF02941924
- R. Criado, A. García del Amo, J. Flores, and M. Romance, Relations between the centrality of a network and its line graph through irregularity measures, in Proceedings of the Seventh International Conference on Engineering Computational Technology, B.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, and M.L. Romero, eds., Civil-Comp Press, Stirlingshire, Paper 27, 2010. doi:10.4203/ccp.94.27.
- R. Criado, A. García del Amo, J. Flores, and M. Romance, Analytical relationships between metric and centrality measures of a network and its dual, J. Comput. Appl. Math. 235 (2011), pp. 1775–1780. doi: 10.1016/j.cam.2010.04.011
- P. Crucitti, V. Latora, and S. Porta, Centrality in networks of urban streets, Chaos 16 (2006), 015113. doi: 10.1063/1.2150162
- P. Crucitti, V. Latora, and S. Porta, Centrality measures in spatial networks of urban streets, Phys. Rev. E 73 (2006), 036125. doi: 10.1103/PhysRevE.73.036125
- E. Estrada, Quantifying network heterogeneity, Phys. Rev. E 82 (2010), 066102. doi: 10.1103/PhysRevE.82.066102
- CJ.L. Gross and J. Yellen (eds.), Handbook of Graph Theory, Discrete Mathematics and its Applications (series editor K.H. Rosen), CRC Press, New York, 2004.
- M.E.J. Newman, The structure and function of complex networks, SIAM Rev. 45 (2003), pp. 167–256. doi: 10.1137/S003614450342480
- V. Nikiforov, Eigenvalues and degree deviation in graphs, Linear Algebra Appl. 414 (2006), pp. 347–360. doi: 10.1016/j.laa.2005.10.011
- E. Ofek, Rigorous analysis of heuristics for NP-hard problems, Ph.D. thesis, Weizmann Institute of Science, Israel, 2006.
- T.A.B. Snijders, The degree variance: An index of graph heterogeneity, Soc. Netw. 3 (1981), pp. 163–174. doi: 10.1016/0378-8733(81)90014-9
- G.W. Stewart and J.-G. Sun, Matrix Perturbation Theory, Academic Press Inc., Boston, 1990.
- S.H. Strogatz, Exploring complex networks, Nature 410 (2001), pp. 268–276. doi: 10.1038/35065725