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

Main Article Content

Fred Y. Ye
Star X. Zhao
Ronald Rousseau

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.

Article Details

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://ajap.um.edu.my/index.php/MJLIS/article/view/6709
Section
Articles

Most read articles by the same author(s)