Clustering Coefficient of the Tensor Product of Graphs
Remarl Joseph M. Damalerio, Rolito G. Eballe
Asian Research Journal of Mathematics · pp. 36–42 · Published 21 May 2022
10.9734/arjom/2022/v18i630382Abstract
Clustering coefficient is one of the most useful indices in complex networks. However, graph theoretic properties of this metric have not been discussed much in the literature, especially in graphs resulting from some binary operations. In this paper we present some expressions for the clustering coefficient of the tensor product of arbitrary graphs, regular graphs, and strongly regular graphs. A Vizing-type upperbound and a sharp lower bound for the clustering coefficient of the tensor product of graphs are also given.
Cited by 1
Jhon J. Aguilar-Alarcón, Juan C. Hernández-Gómez, Jesús Romero-Valencia · Axioms · 2023
Related research
- Global Clustering Coefficient of the Products of Complete Graphs — shares topic coverage
- Global Clustering Coefficient of the Join and Corona of 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.