论文标题
图形张量产物的聚类系数
Clustering Coefficient of the Tensor Product of Graphs
论文作者
论文摘要
聚类系数是复杂网络中最有用的指标之一。但是，该度量的图理论特性在文献中并未在文献中进行太多讨论，尤其是在某些二进制操作引起的图中。在本文中，我们为任意图，常规图和强烈规则图的张量产物的聚类系数提供了一些表达式。还给出了图形张量产物的聚类系数的齐全型上行和锋利的下限。
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.
