Home Articles List Article Information
Iranian Journal of Mathematical Chemistry
Journal Archive
Volume Volume 10 (2019)
Volume Volume 9 (2018)
Volume Volume 8 (2017)
Volume Volume 7 (2016)
Volume Volume 6 (2015)
Volume Volume 5 (2014)
Volume Volume 4 (2013)
Volume Volume 3 (2012)
Volume Volume 2 (2011)
Volume Volume 1 (2010)
RAJTMAJER, S., VUKIČEVIĆ, D. (2010). A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications. Iranian Journal of Mathematical Chemistry, 1(Issue 2 (Special Issue Dedicated to the Pioneering Role of Ivan Gutman In Mathematical Chemistry)), 81-96. doi: 10.22052/ijmc.2010.5158
S. M. RAJTMAJER; D. VUKIČEVIĆ. "A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications". Iranian Journal of Mathematical Chemistry, 1, Issue 2 (Special Issue Dedicated to the Pioneering Role of Ivan Gutman In Mathematical Chemistry), 2010, 81-96. doi: 10.22052/ijmc.2010.5158
RAJTMAJER, S., VUKIČEVIĆ, D. (2010). 'A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications', Iranian Journal of Mathematical Chemistry, 1(Issue 2 (Special Issue Dedicated to the Pioneering Role of Ivan Gutman In Mathematical Chemistry)), pp. 81-96. doi: 10.22052/ijmc.2010.5158
RAJTMAJER, S., VUKIČEVIĆ, D. A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications. Iranian Journal of Mathematical Chemistry, 2010; 1(Issue 2 (Special Issue Dedicated to the Pioneering Role of Ivan Gutman In Mathematical Chemistry)): 81-96. doi: 10.22052/ijmc.2010.5158

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

Article 10, Volume 1, Issue 2 (Special Issue Dedicated to the Pioneering Role of Ivan Gutman In Mathematical Chemistry), Spring 2010, Page 81-96  XML PDF (690.27 K)
Document Type: Research Paper
DOI: 10.22052/ijmc.2010.5158
Authors
S. M. RAJTMAJER1; D. VUKIČEVIĆ2
1University of Dubrovnik, Croatia
2University of Split, Croatia
Abstract
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, while having comparable or higher degree than vertices with greatest closeness centrality and betweenness centrality. As such, they serve as all-purpose network hubs. Several theoretical and real world chemical and biological networks are tested and results are analyzed.
Keywords
Chemical networks; Complex networks; Network hubs; Vertex centrality
Statistics
Article View: 1,270
PDF Download: 699