Clustering Coefficient of the Tensor Product of Graphs
From MaRDI portal
Publication:6396809
arXiv2204.08416MaRDI QIDQ6396809FDOQ6396809
Authors: Remarl Joseph M. Damalerio, Rolito G. Eballe 
Publication date: 18 April 2022
Abstract: 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.
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
This page was built for publication: Clustering Coefficient of the Tensor Product of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6396809)
