Affiliation:
1. Faculty of Mathematics, Autonomous University of Guerrero, Chilpancingo 39000, Mexico
Abstract
The clustering coefficient of a vertex v, of degree at least 2, in a graph Γ is obtained using the formula C(v)=2t(v)deg(v)(deg(v)−1), where t(v) denotes the number of triangles of the graph containing v as a vertex, and the clustering coefficient of Γ is defined as the average of the clustering coefficient of all vertices of Γ, that is, C(Γ)=1|V|∑v∈VC(v), where V is the vertex set of the graph. In this paper, we give explicit expressions for the clustering coefficient of corona and lexicographic products, as well as for the Cartesian sum; such expressions are given in terms of the order and size of factors, and the degree and number of triangles of vertices in each factor.
Subject
Geometry and Topology,Logic,Mathematical Physics,Algebra and Number Theory,Analysis
Reference24 articles.
1. The bridges of Königsberg—A historical perspective;Gribkovskaia;Networks,2007
2. Cayley et le calcul des isomères chimiques;Boulanger;Bibliothèque Tangente,2012
3. On Cayley’s enumeration of alkanes (or 4-valent trees);Rains;J. Integer Seq.,1999
4. Trinajstić, N. (1992). Chemical Graph Theory, CRC Press. [2nd ed.].
5. Estrada, E. (2011). The Structure of Complex Networks, Oxford University Press. [1st ed.].
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献