a novel algorithm for the fast detection of hubs in chemical networks is presented. thealgorithm identifies a set of nodes in the network as most significant, aimed to be the mosteffective points of distribution for fast, widespread coverage throughout the system. we showthat our hubs have in general greater closeness centrality and betweenness centrality thanvertices with maximal degree, while...

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.

In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...

Networks of social relations can be represented by graphs and socioor adjacency-matrices and their structure can be analyzed using different concepts, one of them called centrality. We will provide a new formalization of a “node-centrality” which leads to some properties a measure of centrality has to satisfy. These properties allow to test given measures, for example measures based on degree, ...

the aim of this paper is to determine if the centrality degree and density of latin-american and caribbean countries (la-c) predicts their citation based performance in academic research in the management discipline. for our analysis, we use publication data of the social science citation index in the field of ‘‘management’’ between 1988 and 2013, extracted from isi web of science. the resultin...

this research examines the association between co-authorship network centrality (degree, closeness, betweenness, eigenvector, bonacich flow betweenness) and productivity of information science researchers. the research population includes all those researchers who have published at least one record in one of the twenty journals of information science which has an impact factor of 0.635 as a min...

We formally introduce in this paper two parameters graph theory, namely, clique centrality and global centrality. Let G be a finite, simple undirected of order n. A is nonempty subset W \(\subseteq\) V (G) such that the subgraph \(\langle\)W\(\rangle\)G induced by complete. The maximum size any containing vertex u \(\in\) called G. Normalizing sum centralities all vertices will lead us to G, wh...

This paper presents a centrality measurement and analysis of the social networks for tracking online community. The tracking of single community in social networks is commonly done using some of the centrality measures employed in social network community tracking. The ability that centrality measures have to determine the relative position of a node within a network has been used in previous r...