Article
Version 1
Preserved in Portico This version is not peer-reviewed
Clustering Coefficient of Lexicographic Products
Version 1
: Received: 10 May 2024 / Approved: 10 May 2024 / Online: 10 May 2024 (16:55:41 CEST)
How to cite: Holly, M. Clustering Coefficient of Lexicographic Products. Preprints 2024, 2024050713. https://doi.org/10.20944/preprints202405.0713.v1 Holly, M. Clustering Coefficient of Lexicographic Products. Preprints 2024, 2024050713. https://doi.org/10.20944/preprints202405.0713.v1
Abstract
Clustering coefficient measures are key complex network analysis tools. We examine local and global clustering coefficient measures with respect to the lexicographic graph product. As a preliminary condition, we analyze the $K_3$ subgraph structure focused on vertex inclusion with respect to the product graph. From this structure, we determine both the clustering coefficient for the product graph vertices and the average clustering coefficient for the product graph.
Keywords
lexicographic graph product; clustering coefficient; average clustering coefficient
Subject
Computer Science and Mathematics, Discrete Mathematics and Combinatorics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
