Abstract
The global clustering coecient 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 coeffcient 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
