Summary
2011 International Symposium on Nonlinear Theory and Its Applications
2011
Session Number:A1L-D
Session:
Number:A1L-D4
Controlling Clustering Coefficient of Graphs by Means of 2-Switch Method
Tatsuya Fukami, Norikazu Takahashi,
pp.64-67
Publication Date:2011/9/4
Online ISSN:2188-5079
Summary:
Aclustering coefficient control algorithm for simple connected undirected graphs is studied. This algorithm is based on the 2-switch which is a well-known graph transformation that preserves the degree of each node. We first derive an explicit formula for the amount of change in the clustering coefficient caused by a single 2-switch. We next show through computer simulations that the clustering coefficient of scale-free graphs can be controlled over a wide range by using this algorithm.