Tuning the clustering coefficient of generalized circulant networks

Robert E. Kooij, Nikolaj Horsevad Sørensen, Roland Bouffanais*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

3 Citations (Scopus)
25 Downloads (Pure)


Apart from the role the clustering coefficient plays in the definition of the small-world phenomena, it also has great relevance for practical problems involving networked dynamical systems. To study the impact of the clustering coefficient on dynamical processes taking place on networks, some authors have focused on the construction of graphs with tunable clustering coefficients. These constructions are usually realized through a stochastic process, either by growing a network through the preferential attachment procedure, or by applying a random rewiring process. In contrast, we consider here several families of static graphs whose clustering coefficients can be determined explicitly. The basis for these families is formed by the k-regular graphs on N nodes, that belong to the family of so-called circulant graphs denoted by CN,k. We show that the expression for the clustering coefficient of CN,k reported in literature, only holds for sufficiently large N. Next, we consider three generalizations of the circulant graphs, either by adding some pendant links to CN,k, or by connecting, in two different ways, an additional node to some nodes of CN,k. For all three generalizations, we derive explicit expressions for the clustering coefficient. Finally, we construct a family of pairs of generalized circulant graphs, with the same number of nodes and links, but with different clustering coefficients.

Original languageEnglish
Article number126088
Pages (from-to)1-13
Number of pages13
JournalPhysica A: Statistical Mechanics and its Applications
Publication statusPublished - 2021

Bibliographical note

Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care
Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.


  • Circulant graphs
  • Clustered networks
  • Complex networks
  • Consensus dynamics


Dive into the research topics of 'Tuning the clustering coefficient of generalized circulant networks'. Together they form a unique fingerprint.

Cite this