{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T21:23:14Z","timestamp":1777411394229,"version":"3.51.4"},"reference-count":24,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T00:00:00Z","timestamp":1697241600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>The clustering coefficient of a vertex v, of degree at least 2, in a graph \u0393 is obtained using the formula C(v)=2t(v)deg(v)(deg(v)\u22121), where t(v) denotes the number of triangles of the graph containing v as a vertex, and the clustering coefficient of \u0393 is defined as the average of the clustering coefficient of all vertices of \u0393, that is, C(\u0393)=1|V|\u2211v\u2208VC(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.<\/jats:p>","DOI":"10.3390\/axioms12100968","type":"journal-article","created":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T14:59:59Z","timestamp":1697295599000},"page":"968","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Clustering Coefficient for Graph Products"],"prefix":"10.3390","volume":"12","author":[{"given":"Jhon J.","family":"Aguilar-Alarc\u00f3n","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Autonomous University of Guerrero, Chilpancingo 39000, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1429-3644","authenticated-orcid":false,"given":"Juan C.","family":"Hern\u00e1ndez-G\u00f3mez","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Autonomous University of Guerrero, Chilpancingo 39000, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3606-890X","authenticated-orcid":false,"given":"Jes\u00fas","family":"Romero-Valencia","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Autonomous University of Guerrero, Chilpancingo 39000, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,10,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/net.20159","article-title":"The bridges of K\u00f6nigsberg\u2014A historical perspective","volume":"49","author":"Gribkovskaia","year":"2007","journal-title":"Networks"},{"key":"ref_2","first-page":"90","article-title":"Cayley et le calcul des isom\u00e8res chimiques","volume":"43","author":"Boulanger","year":"2012","journal-title":"Biblioth\u00e8que Tangente"},{"key":"ref_3","first-page":"9911","article-title":"On Cayley\u2019s enumeration of alkanes (or 4-valent trees)","volume":"2","author":"Rains","year":"1999","journal-title":"J. Integer Seq."},{"key":"ref_4","unstructured":"Trinajsti\u0107, N. (1992). Chemical Graph Theory, CRC Press. [2nd ed.]."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Estrada, E. (2011). The Structure of Complex Networks, Oxford University Press. [1st ed.].","DOI":"10.1093\/acprof:oso\/9780199591756.003.0010"},{"key":"ref_6","unstructured":"Newman, M., Barab\u00e1si, A.L., and Watts, D.J. (2006). The Structure and Dynamics of Networks, Princeton University Press. [1st ed.]."},{"key":"ref_7","unstructured":"Watts, D.J. (2003). Six Degrees: The Science of a Connected Age, W. W. Norton & Company. [1st ed.]."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2307\/2786545","article-title":"An experimental study of the small-world problem","volume":"32","author":"Traver","year":"1969","journal-title":"Sociometry"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2019small world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.neuroimage.2008.08.010","article-title":"Small-world and scale-free organization of voxel-based resting-state functional connectivity in the human brain","volume":"43","author":"Stam","year":"2008","journal-title":"Neuroimage"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"057102","DOI":"10.1103\/PhysRevE.65.057102","article-title":"Growing scale-free networks with small-world behavior","volume":"65","author":"Klemm","year":"2002","journal-title":"Phys. Rev. E"},{"key":"ref_12","first-page":"1","article-title":"Graph clustering with graph neural networks","volume":"24","author":"Tsitsulin","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref_13","unstructured":"Liu, J., Wang, C., Danilevsky, M., and Han, J. (2013, January 3\u20139). Large-scale spectral clustering on graphs. Proceedings of the 2013 International Joint Conference on Artificial Intelligence, Beijing, China."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.9734\/arjom\/2022\/v18i630382","article-title":"Clustering coefficient of the tensor product of graphs","volume":"18","author":"Damalerio","year":"2022","journal-title":"Asian Res. J. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"62","DOI":"10.9734\/arjom\/2022\/v18i630384","article-title":"Global clustering coefficient of the products of complete graphs","volume":"18","author":"Damalerio","year":"2022","journal-title":"Asian Res. J. Math."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Graph clustering","volume":"1","author":"Schaeffer","year":"2007","journal-title":"Comput. Sci. Rev."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1109\/34.765656","article-title":"A robust competitive clustering algorithm with applications in computer vision","volume":"21","author":"Frigui","year":"1999","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.dam.2018.06.008","article-title":"Total roman domination in the lexicographic product of graphs","volume":"263","author":"Campanelli","year":"2019","journal-title":"Discret. Appl. Math."},{"key":"ref_19","first-page":"80","article-title":"On the edge irregularity strength of corona product of graphs with paths","volume":"16","author":"Tarawneh","year":"2016","journal-title":"Appl. Math. -Notes"},{"key":"ref_20","first-page":"24","article-title":"Computing F-Index of different corona products of graphs","volume":"19","author":"De","year":"2017","journal-title":"Bull. Math. Sci. Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.14445\/22315373\/IJMTT-V66I4P523","article-title":"Super fair domination in the corona and lexicographic product of graphs","volume":"66","author":"Enriquez","year":"2020","journal-title":"Int. J. Math. Trends Technol."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.3233\/FI-2015-1263","article-title":"On the strong metric dimension of cartesian sum graphs","volume":"141","author":"Kuziak","year":"2015","journal-title":"Fundam. Informaticae"},{"key":"ref_23","first-page":"1","article-title":"The Schultz index for product graphs","volume":"13","year":"2022","journal-title":"Iranian J. Math. Chem."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Harary, F. (1969). Graph Theory, Addison-Wesley.","DOI":"10.21236\/AD0705364"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/10\/968\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T21:06:49Z","timestamp":1760130409000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/10\/968"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,14]]},"references-count":24,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2023,10]]}},"alternative-id":["axioms12100968"],"URL":"https:\/\/doi.org\/10.3390\/axioms12100968","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,14]]}}}