In this paper, the impact of the clustering exponent ($\alpha$) on synchronizability, average shortest path length and navigability of small-world networks generated by one dimensional Klein berg model is investigated. It could be seen from the analysis that the synchronizability becomes stronger as the clustering exponent decreases. And the navigability achieves peak at the neighborhood of $\alpha=1$, as well as the navigability becomes smaller as the clustering exponent increases. Moreover, the average path length of one dimensional Klein berg small-world network decreases with respect to increasing clustering exponent. And this phenomenon is verified by numerical simulations on a network of R\"{o}ssler oscillators. Then, it could be deduced from the phenomenon observed that compared with the low probabilities of longer distance of the edge-adding, the high probabilities of shorter distance of the edge-adding could achieve better synchronizability.
['Jingyi Wang', 'Chen Xu', 'Jianwen Feng']
Synchronizability and Navigability of Small-World Networks Generated by One Dimensional Kleinberg Model