Bridging Centrality in Scale- Free Network Using Bridging Nodes as the Boundary of Clustering

Graph theory is one of the most popular fields in mathematics because if it's important applications in solving many problems in the real world and understanding many natural phenomena. This work focuses mainly on studying the scale-free networks and their properties. Moreover, it deals with the study of clustering methods and developing a new a new clustering algorithm by using the properties of scale-free networks. Bridging centrality of the graph together with Between ness centrality and bridging coefficients will also be investigated. Finally we will illustrate how bridging centrality is used in clustering. This will result in a new algorithm of clustering that is called Highest Bridging Centrality Cut algorithm (HCRC algorithm). We concluded that the HCRC algorithm depends on bridging centrality of the nodes.