Global Clustering Coefficient of the Join and Corona of Graphs
Asian Research Journal of Mathematics,
The global clustering coefficient is one of the most useful indices in complex network analysis. It is another metric that somehow measures how close a graph from being a complete graph. In this paper we present some expressions for the global clustering coefficient of the join G v H and corona G o H of arbitrary simple and undirected graphs G and H. As corollaries to these results, we will show that for the path Pm, cycle Cm, fan Fm, and wheel Wm, both Cc(Pm v Pm) and Cc(Cm v Cm) approach to 0 as m increases without bound, while Cc(Fm), Cc(Wm), Cc(Pm o Pm), and Cc(Cm o Cm) all approach to 2/3.
- Clustering coefficient
- vertex corona
How to Cite
Abstract View: 75 times
PDF Download: 29 times