Global Clustering Coefficient of the Join and Corona of Graphs
Remarl Joseph M. Damalerio, Rolito G. Eballe, Cherry Mae R. Balingit, Isagani S. Cabahug Jr., Ann Leslie V. Flores
Asian Research Journal of Mathematics · pp. 128–140 · Published 28 Dec 2022
10.9734/arjom/2022/v18i12632Abstract
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.
Cited by 1
Boris Melnikov, Bowen Liu · Mathematics · 2025
Related research
- Clustering Coefficient of the Tensor Product of Graphs — shares topic coverage
- Global Clustering Coefficient of the Products of Complete Graphs — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.