Asian Research Journal of Mathematics

Abstract

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(P_m v P_m) and Cc(C_m v C_m) approach to 0 as m increases without bound, while Cc(F_m), Cc(W_m), Cc(P_m o P_m), and Cc(C_m o C_m) all approach to 2/3.