Global Clustering Coefficient of the Products of Complete Graphs
Remarl Joseph M. Damalerio, Rolito G. Eballe
Asian Research Journal of Mathematics · pp. 62–69 · Published 23 May 2022
10.9734/arjom/2022/v18i630384Abstract
The global clustering Coefficient Cc(G) of a connected graph G of order at least 3 is a metric that somehow measures how close G to being a complete graph. Its value ranges from 0 to 1. In this paper, we will show that for the tensor product Km ⊗ Km and cartesian product Km ʘ Km Cc(Km⊗Km) and Cc(Km ʘ Km ) approach to 1 and 1=2, respectively, as m → ∞.
Cited by 1
Jhon J. Aguilar-Alarcón, J. C. Hernández-Gómez, Jesús Romero-Valencia · Axioms · 2023
Related research
- The Universal Coefficient Theorem for Homology and Cohomology: An Enigma of Computations — shares topic coverage
- Linear Maps Preserving Rank-additivity and Rank-sum-minimal on Tensor Products of Matrix Spaces — shares topic coverage
- On Natural Characterizations of Tensor Integrability — shares topic coverage
- On the Weyl Approach to Tensor Representations of Exceptional Lie Groups: The Case of G2 and F4 — shares topic coverage
- Tensor Integral: A New Comprehensive Approach to the Integration Theory — 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.