摘要
在研究小世界网络和Cayley图的基础上,采用基于Cayley图的代数图论方法,给出一种具有高对称性的小世界网络模型,分析该模型的聚类系数和特征路径长度等小世界性质,给出其路由算法。分析结果表明,该模型聚类性高、网络直径小,具有小世界特性。
Based on research of small-world network and Cayley graph,it adopts the algebra and graph theory method of Cayley graph,a model of small-world network with high symmetry is proposed.Some properties of small-world such as clustering coefficient and characteristic path length are analyzed.A routing algorithm is developed.Results of analysis and simulation testify this model provides high local clustering and low network diameter,possesses the property of small-world.
出处
《计算机工程》
CAS
CSCD
北大核心
2011年第5期112-114,117,共4页
Computer Engineering
关键词
小世界
CAYLEY图
特征路径长度
聚类系数
对称性
small world
Cayley graph
characteristic path length
clustering coefficient
symmetry
