Table of Contents
International Scholarly Research Notices
Volume 2014, Article ID 871038, 10 pages
http://dx.doi.org/10.1155/2014/871038
Research Article

Balanced Centrality of Networks

Department of Mathematics, Faculty of Science, University of Malta Msida, MSD 2080, Malta

Received 28 March 2014; Accepted 13 July 2014; Published 3 November 2014

Academic Editor: Yongtang Shi

Copyright © 2014 Mark Debono et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Angelini, S. Boccaletti, D. Marinazzo, M. Pellicoro, and S. Stramaglia, “Identification of network modules by optimization of ratio association,” Chaos, vol. 17, Article ID 023114, 2007. View at Publisher · View at Google Scholar
  2. N. Masuda, H. Miwa, and N. Konno, “Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights,” Physical Review E, vol. 70, no. 3, Article ID 036124, 9 pages, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, vol. 8 of Structural Analysis in the Social Sciences, Cambridge University Press, 1st edition, 1994.
  4. D. Cvetkovic, P. Rowlinson, and S. Simic, Eigenspaces of Graphs, Cambridge University Press, Cambridge, UK, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  5. I. Sciriha and D. M. Cardoso, “Necessary and sufficient conditions for a Hamiltonian graph,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 80, pp. 127–150, 2012. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. A. Farrugia and I. Sciriha, “The main eigenvalues and number of walks in self—complementary graphs,” Linear and Multilinear Algebra, 2013. View at Publisher · View at Google Scholar
  7. P. Rowlinson, “The main eigenvalues of a graph: a survey,” Applicable Analysis and Discrete Mathematics, vol. 1, no. 2, pp. 445–471, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. M. E. J. Newman, Networks. March 2010.
  9. P. Bonacich, “When network eigenvector centrality misbehaves: some lessons,” in Proceedings of the International Conference on Network Science, 2006.
  10. M. Debono, Threshold graphs in real world networks [M.Sc. thesis], University of Malta, 2012.
  11. F. Chung, L. Lu, and V. Vu, “The spectra of random graphs with given expected degrees,” Internet Mathematics, vol. 1, no. 3, pp. 257–275, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. P. Bonacich, “Power and centrality: a family of measures,” The American Journal of Sociology, vol. 92, no. 5, pp. 1170–1182, 1987. View at Google Scholar
  13. L. Katz, “A new status index derived from sociometric analysis,” Psychometrika, vol. 18, no. 1, pp. 39–43, 1953. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. E. Estrada and J. A. Rodríguez-Velázquez, “Subgraph centrality in complex networks,” Physical Review E, vol. 71, no. 5, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  15. P. Bonacich and P. Lloyd, “Eigenvector-like measures of centrality for asymmetric relations,” Social Networks, vol. 23, no. 3, pp. 191–201, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. R. Merris, “Antiregular graphs are universal for trees,” Univerzitet u Beogradu. Publikacije Elektrotehnickog Fakulteta. Serija Matematika, vol. 14, pp. 1–3, 2003. View at Google Scholar