Abstract: In this paper we establish the relation between some graph parameters, particularly, clustering coefficients and conductance, with the synchronization of the network. There is a recent interest in the study of how the parameters relating the topology of the graph a§ect the synchronizability of the network associated with the graph. As results between the conductance and the synchronizability are known, we address our work to the relations between clustering and conductance of a graph in order to analyze the e§ect of clustering in the amplitude of the synchronization interval.

References
[1] S.L. Bezrukov, Edge Isoperimetric Problems on Graphs, Graph Theory and Combinatorial Biology, Bolyai Soc. Math. Stud., 7, 157-197, (1999).
[2] F. Comellas and S. Gago, Synchronizability of complex networks, J. Phys. A: Math. Theor, 40, 4483-4492, (2007).
[3] Z. Duan, W. Wang, C. Liu, G. Chen, Are networks with more edges easier to synchronize?, arXiv:0711.2442v1, (2007).
[4] S. Elaydi, Discrete Chaos, Second Edition: With Applications in Science and Engineering, Chapman & Hall/CRC, 2 edition, (2007).
[5] P. E. Kloeden, Synchronization of Discrete Time Dynamical Systems, Journal of Difference Equations and Applications, 10, (13-15), 1133 - 1138, (2004).
[6] P. N. McGraw and M. Menzinger, Clustering and the synchronization of oscillator networks, Phys. Rev. E, 72, 015101(R), (2005).