Cayley graphs as models of deterministic small-world networks

Information Processing Letters

Volumn 97, Issue 3, 2006, Pages 115-117

  Xiao, Wenjun ^a   Parhami, Behrooz ^b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b Santa Barbara   (United States)

Author keywords

Average internode distance; Cayley graph; Clustering coefficient; Interconnection network; Low diameter network

Indexed keywords

DATA PROCESSING; DISTRIBUTED PARAMETER CONTROL SYSTEMS; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PROBABILISTIC LOGICS;

AVERAGE INTERNODE DISTANCE; CAYLEY GRAPH; CLUSTERING COEFFICIENTS; LOW-DIAMETER NETWORKS;

GRAPH THEORY;

EID: 29144529718     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.10.001     Document Type: Article

References (9)

1. S.B. Akers, and B. Krishnamurthy A group theoretic model for symmetric interconnection networks IEEE Trans. Comput. 38 1989 555 566
2. R. Albert, and A.L. Barabasi Statistical mechanics of complex networks Rev. Modern Phys. 74 2002 47 97
3. F. Annexstein, M. Baumslag, and A.L. Rosenberg Group action graphs and parallel architectures SIAM J. Comput. 19 1990 544 569
4. J.-C. Bermond, C. Delorme, and J.-J. Quisquater Tables of large graphs with given degree and diameter Inform. Process. Lett. 15 1 1982 10 13
5. N. Biggs Algebraic Graph Theory 1993 Cambridge University Press Cambridge
6. F. Comellas, and M. Sampels Deterministic small-world networks Physica A 309 2002 231 235
7. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes 1992 Morgan Kaufmann Los Altos, CA
8. B. Parhami Introduction to Parallel Processing: Algorithms and Architectures 1999 Plenum New York
9. D.J. Watts, and S.H. Strogatz Collective dynamics of 'small-world' networks Nature 393 1998 440 442