AN EMPIRICAL RELATION BETWEEN K-SHELLS AND THE H-INDEX IN SCALE-FREE NETWORKS

Authors

  • Fred Y. Ye Zhejiang University, Department of Information Resource Management, Hangzhou, CHINA
  • Star X. Zhao Zhejiang University, Department of Information Resource Management, Hangzhou, CHINA
  • Ronald Rousseau KHBO (Association K.U.Leuven), Faculty of Engineering Technology, Zeedijk 101, B-8400 Oostende, BELGIUM

Keywords:

h-index, k-shells, Power laws, Graphs, Scale-free networks

Abstract

After clarifying the definitions of h-index and k-shells in a graph, it is shown that the largest k value for which there exists a non-empty k-shell, denoted as kmax(G), satisfies the relation kmax(G) ≤ h(G) , where h(G) is the degree h-index of graph G. Next we determine an empirical relation between the hindex, the number of nodes in a small scale-free network, i.e. with maximum degree centrality < 100, and the coreness and degree centrality of its nodes. In this contribution we embed the information sciences among other fields involved in network studies.

Downloads

Download data is not yet available.

Downloads

Published

31-05-2017

How to Cite

Ye, F. Y., Zhao, S. X., & Rousseau, R. (2017). AN EMPIRICAL RELATION BETWEEN K-SHELLS AND THE H-INDEX IN SCALE-FREE NETWORKS. Malaysian Journal of Library and Information Science, 16(3), 9–16. Retrieved from https://jupidi.um.edu.my/index.php/MJLIS/article/view/6709

Issue

Vol. 16 No. 3 (2011): Malaysian Journal of Library & Information Science

Section

Articles

License

It is a condition of publication that manuscripts submitted to the journal have not been published, accepted for publication, nor simultaneously submitted for publication elsewhere. By submitting a manuscript, the author(s) agree that copyright for the article is transferred to the publisher, if and when the manuscript is accepted for publication.

Most read articles by the same author(s)