Publication
Title
An empirical relation between k-shells and the h-index in scale-free networks
Author
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 h-index, 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.
Language
English
Source (journal)
Malaysian journal of library & information science / Universiti Malaya. Fakulti Sains Komputer dan Teknologi Maklumat; Universiti Malaya. Masters of Library and Information Science Program. - Kuala Lumpur, 1996, currens
Publication
Kuala Lumpur : University of Malaya, Faculty of Computer Science and Information Technology, 2011
ISSN
1394-6234
Volume/pages
16:3(2011), p. 9-16
ISI
000296589000002
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 06.01.2012
Last edited 11.11.2017
To cite this reference