General Method to Build Deterministic Small-World Networks Based on Cayley Graph

Author

Zhang, Zhen ; Xiao, Wenjun ; Wang, Xiaoming

Author_Institution

Dept. of Comput. Sci., South China Univ. of Technol., Guanghzou, China

Volume

1

fYear

2009

fDate

28-30 Oct. 2009

Firstpage

493

Lastpage

496

Abstract

Many real-life networks, such as the WWW, biological realms, and social networks are small-world networks. Most previous researches on small-world networks have been based on probabilistic methods. In this paper, we present a general method by using Cayley graph to build deterministic small-world networks. We also analyze the cluster topology of the Cayley graph with small world properties by constructing its left Coset graph. This method has great value in constructing interconnection networks model and analyzing many other real network models.

Keywords

graph theory; interconnected systems; pattern clustering; Cayley graph; Coset graph; cluster topology; deterministic small-world networks; interconnection networks; Biology; Computer science; Eigenvalues and eigenfunctions; Integrated circuit interconnections; Joining processes; Multiprocessor interconnection networks; Network topology; Power generation; Social network services; World Wide Web; Cayley graph; Clustering; Coset Graph; Interconnection networks; Small-world networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Engineering, 2009. WCSE '09. Second International Workshop on

Conference_Location

Qingdao

Print_ISBN

978-0-7695-3881-5

Type

conf

DOI

10.1109/WCSE.2009.717

Filename

5403418