Table of Contents
International Journal of Combinatorics
Volume 2014, Article ID 241723, 12 pages
http://dx.doi.org/10.1155/2014/241723
Research Article

Betweenness Centrality in Some Classes of Graphs

Department of Computer Applications, Cochin University of Science and Technology, Cochin 682022, India

Received 21 May 2014; Accepted 21 October 2014; Published 25 December 2014

Academic Editor: Chris A. Rodger

Copyright © 2014 Sunil Kumar Raghavan Unnithan 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. E. Otte and R. Rousseau, “Social network analysis: a powerful strategy, also for the information sciences,” Journal of Information Science, vol. 28, no. 6, pp. 441–453, 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. K. Park and A. Yilmaz, “A social network an analysis approach to analyze road networks,” in Proceedings of the ASPRS Annual Conference, San Diego, Calif, USA, 2010.
  3. V. Latora and M. Marchiori, “A measure of centrality based on network efficiency,” New Journal of Physics, vol. 9, article 188, 2007. View at Publisher · View at Google Scholar · View at Scopus
  4. E. Estrada, “Virtual identification of essential proteins within the protein interaction network of yeast,” Proteomics, vol. 6, no. 1, pp. 35–40, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. L. C. Freeman, “Centrality in social networks conceptual clarification,” Social Networks, vol. 1, no. 3, pp. 215–239, 1979. View at Publisher · View at Google Scholar · View at Scopus
  6. D. Koschützki and F. Schreiber, “Centrality analysis methods for biological networks and their application to gene regulatory networks,” Gene Regulation and Systems Biology, vol. 2008, no. 2, pp. 193–201, 2008. View at Google Scholar · View at Scopus
  7. A. M. M. González, B. Dalsgaard, and J. M. Olesen, “Centrality measures and the importance of generalist species in pollination networks,” Ecological Complexity, vol. 7, no. 1, pp. 36–43, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. M. E. J. Newman, “Scientific collaboration networks. II. sho rtest paths, weighted networks, and centrality,” Physical Review E, vol. 64, no. 1, pp. 1–7, 2001. View at Google Scholar · View at Scopus
  9. M. Rubinov and O. Sporns, “Complex network measures of brain connectivity: uses and interpretations,” NeuroImage, vol. 52, no. 3, pp. 1059–1069, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. P. Bonacich, “Power and centrality: a family of measures,” American Journal of Sociology, vol. 92, no. 5, pp. 1170–1182, 1987. View at Google Scholar
  11. S. P. Borgatti, “Centrality and network flow,” Social Networks, vol. 27, no. 1, pp. 55–71, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. S. P. Borgatti and M. G. Everett, “A graph-theoretic perspective on centrality,” Social Networks, vol. 28, no. 4, pp. 466–484, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. E. Estrada, D. J. Higham, and N. Hatano, “Communicability betweenness in complex networks,” Physica A: Statistical Mechanics and its Applications, vol. 388, no. 5, pp. 764–774, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Gago, J. Coroničová Hurajová, and T. Madaras, “On betweenness-uniform graphs,” Czechoslovak Mathematical Journal, vol. 63, no. 3, pp. 629–642, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. A. Bavelas, “A mathematical model for group structure. Human organization,” Applied Anthropology, vol. 7, no. 3, pp. 16–30, 1948. View at Google Scholar
  16. L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, vol. 40, pp. 35–41, 1977. View at Google Scholar
  17. D. Cvetkovic, M. Doob, and S. Simic, “Generalized line graphs,” Journal of Graph Theory, vol. 5, no. 4, pp. 385–399, 1981. View at Publisher · View at Google Scholar · View at MathSciNet
  18. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, UK, 1993. View at MathSciNet
  19. H. Hosoya and F. Harary, “On the matching properties of three fence graphs,” Journal of Mathematical Chemistry, vol. 12, no. 1, pp. 211–218, 1993. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. M. Noy and A. Ribó, “Recursively constructible families of graphs,” Advances in Applied Mathematics, vol. 32, no. 1-2, pp. 350–363, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass, USA, 1969. View at MathSciNet
  22. S. Foldes, “A characterization of hypercubes,” Discrete Mathematics, vol. 17, no. 2, pp. 155–159, 1977. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. Y. Saad and M. H. Schultz, “Topological properties of hypercubes,” IEEE Transactions on Computers, vol. 37, no. 7, pp. 867–872, 1988. View at Publisher · View at Google Scholar · View at Scopus
  24. H. M. Mulder, “Interval-regular graphs,” Discrete Mathematics, vol. 41, no. 3, pp. 253–269, 1982. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus